Metamath Proof Explorer


Theorem ssuzfz

Description: A finite subset of the upper integers is a subset of a finite set of sequential integers. (Contributed by Glauco Siliprandi, 11-Oct-2020)

Ref Expression
Hypotheses ssuzfz.1 Z = M
ssuzfz.2 φ A Z
ssuzfz.3 φ A Fin
Assertion ssuzfz φ A M sup A <

Proof

Step Hyp Ref Expression
1 ssuzfz.1 Z = M
2 ssuzfz.2 φ A Z
3 ssuzfz.3 φ A Fin
4 2 sselda φ k A k Z
5 4 1 eleqtrdi φ k A k M
6 eluzel2 k M M
7 5 6 syl φ k A M
8 uzssz M
9 1 8 eqsstri Z
10 9 a1i φ Z
11 2 10 sstrd φ A
12 11 adantr φ k A A
13 ne0i k A A
14 13 adantl φ k A A
15 3 adantr φ k A A Fin
16 suprfinzcl A A A Fin sup A < A
17 12 14 15 16 syl3anc φ k A sup A < A
18 12 17 sseldd φ k A sup A <
19 11 sselda φ k A k
20 7 18 19 3jca φ k A M sup A < k
21 eluzle k M M k
22 5 21 syl φ k A M k
23 zssre
24 23 a1i φ
25 11 24 sstrd φ A
26 25 adantr φ k A A
27 simpr φ k A k A
28 eqidd φ k A sup A < = sup A <
29 26 15 27 28 supfirege φ k A k sup A <
30 20 22 29 jca32 φ k A M sup A < k M k k sup A <
31 elfz2 k M sup A < M sup A < k M k k sup A <
32 30 31 sylibr φ k A k M sup A <
33 32 ex φ k A k M sup A <
34 33 ralrimiv φ k A k M sup A <
35 dfss3 A M sup A < k A k M sup A <
36 34 35 sylibr φ A M sup A <