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 eluzle ⊢ k ∈ ℤ ≥ M → M ≤ k
21 5 20 syl ⊢ φ ∧ k ∈ A → M ≤ k
22 zssre ⊢ ℤ ⊆ ℝ
23 22 a1i ⊢ φ → ℤ ⊆ ℝ
24 11 23 sstrd ⊢ φ → A ⊆ ℝ
25 24 adantr ⊢ φ ∧ k ∈ A → A ⊆ ℝ
26 simpr ⊢ φ ∧ k ∈ A → k ∈ A
27 eqidd ⊢ φ ∧ k ∈ A → sup A ℝ < = sup A ℝ <
28 25 15 26 27 supfirege ⊢ φ ∧ k ∈ A → k ≤ sup A ℝ <
29 7 18 19 21 28 elfzd ⊢ φ ∧ k ∈ A → k ∈ M … sup A ℝ <
30 29 ex ⊢ φ → k ∈ A → k ∈ M … sup A ℝ <
31 30 ralrimiv ⊢ φ → ∀ k ∈ A k ∈ M … sup A ℝ <
32 dfss3 ⊢ A ⊆ M … sup A ℝ < ↔ ∀ k ∈ A k ∈ M … sup A ℝ <
33 31 32 sylibr ⊢ φ → A ⊆ M … sup A ℝ <