Metamath Proof Explorer


Theorem uzfissfz

Description: For any finite subset of the upper integers, there is a finite set of sequential integers that includes it. (Contributed by Glauco Siliprandi, 17-Aug-2020)

Ref Expression
Hypotheses uzfissfz.m ⊢ φ → M ∈ ℤ
uzfissfz.z ⊢ Z = ℤ ≥ M
uzfissfz.a ⊢ φ → A ⊆ Z
uzfissfz.fi ⊢ φ → A ∈ Fin
Assertion uzfissfz ⊢ φ → ∃ k ∈ Z A ⊆ M … k

Proof

Step Hyp Ref Expression
1 uzfissfz.m ⊢ φ → M ∈ ℤ
2 uzfissfz.z ⊢ Z = ℤ ≥ M
3 uzfissfz.a ⊢ φ → A ⊆ Z
4 uzfissfz.fi ⊢ φ → A ∈ Fin
5 uzid ⊢ M ∈ ℤ → M ∈ ℤ ≥ M
6 1 5 syl ⊢ φ → M ∈ ℤ ≥ M
7 2 a1i ⊢ φ → Z = ℤ ≥ M
8 7 eqcomd ⊢ φ → ℤ ≥ M = Z
9 6 8 eleqtrd ⊢ φ → M ∈ Z
10 9 adantr ⊢ φ ∧ A = ∅ → M ∈ Z
11 id ⊢ A = ∅ → A = ∅
12 0ss ⊢ ∅ ⊆ M … M
13 12 a1i ⊢ A = ∅ → ∅ ⊆ M … M
14 11 13 eqsstrd ⊢ A = ∅ → A ⊆ M … M
15 14 adantl ⊢ φ ∧ A = ∅ → A ⊆ M … M
16 oveq2 ⊢ k = M → M … k = M … M
17 16 sseq2d ⊢ k = M → A ⊆ M … k ↔ A ⊆ M … M
18 17 rspcev ⊢ M ∈ Z ∧ A ⊆ M … M → ∃ k ∈ Z A ⊆ M … k
19 10 15 18 syl2anc ⊢ φ ∧ A = ∅ → ∃ k ∈ Z A ⊆ M … k
20 3 adantr ⊢ φ ∧ ¬ A = ∅ → A ⊆ Z
21 uzssz ⊢ ℤ ≥ M ⊆ ℤ
22 2 21 eqsstri ⊢ Z ⊆ ℤ
23 22 a1i ⊢ φ → Z ⊆ ℤ
24 3 23 sstrd ⊢ φ → A ⊆ ℤ
25 24 adantr ⊢ φ ∧ ¬ A = ∅ → A ⊆ ℤ
26 11 necon3bi ⊢ ¬ A = ∅ → A ≠ ∅
27 26 adantl ⊢ φ ∧ ¬ A = ∅ → A ≠ ∅
28 4 adantr ⊢ φ ∧ ¬ A = ∅ → A ∈ Fin
29 suprfinzcl ⊢ A ⊆ ℤ ∧ A ≠ ∅ ∧ A ∈ Fin → sup A ℝ < ∈ A
30 25 27 28 29 syl3anc ⊢ φ ∧ ¬ A = ∅ → sup A ℝ < ∈ A
31 20 30 sseldd ⊢ φ ∧ ¬ A = ∅ → sup A ℝ < ∈ Z
32 1 ad2antrr ⊢ φ ∧ ¬ A = ∅ ∧ j ∈ A → M ∈ ℤ
33 22 31 sselid ⊢ φ ∧ ¬ A = ∅ → sup A ℝ < ∈ ℤ
34 33 adantr ⊢ φ ∧ ¬ A = ∅ ∧ j ∈ A → sup A ℝ < ∈ ℤ
35 25 sselda ⊢ φ ∧ ¬ A = ∅ ∧ j ∈ A → j ∈ ℤ
36 3 sselda ⊢ φ ∧ j ∈ A → j ∈ Z
37 2 a1i ⊢ φ ∧ j ∈ A → Z = ℤ ≥ M
38 36 37 eleqtrd ⊢ φ ∧ j ∈ A → j ∈ ℤ ≥ M
39 eluzle ⊢ j ∈ ℤ ≥ M → M ≤ j
40 38 39 syl ⊢ φ ∧ j ∈ A → M ≤ j
41 40 adantlr ⊢ φ ∧ ¬ A = ∅ ∧ j ∈ A → M ≤ j
42 zssre ⊢ ℤ ⊆ ℝ
43 24 42 sstrdi ⊢ φ → A ⊆ ℝ
44 43 ad2antrr ⊢ φ ∧ ¬ A = ∅ ∧ j ∈ A → A ⊆ ℝ
45 27 adantr ⊢ φ ∧ ¬ A = ∅ ∧ j ∈ A → A ≠ ∅
46 fimaxre2 ⊢ A ⊆ ℝ ∧ A ∈ Fin → ∃ x ∈ ℝ ∀ y ∈ A y ≤ x
47 43 4 46 syl2anc ⊢ φ → ∃ x ∈ ℝ ∀ y ∈ A y ≤ x
48 47 ad2antrr ⊢ φ ∧ ¬ A = ∅ ∧ j ∈ A → ∃ x ∈ ℝ ∀ y ∈ A y ≤ x
49 simpr ⊢ φ ∧ ¬ A = ∅ ∧ j ∈ A → j ∈ A
50 suprub ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A y ≤ x ∧ j ∈ A → j ≤ sup A ℝ <
51 44 45 48 49 50 syl31anc ⊢ φ ∧ ¬ A = ∅ ∧ j ∈ A → j ≤ sup A ℝ <
52 32 34 35 41 51 elfzd ⊢ φ ∧ ¬ A = ∅ ∧ j ∈ A → j ∈ M … sup A ℝ <
53 52 ralrimiva ⊢ φ ∧ ¬ A = ∅ → ∀ j ∈ A j ∈ M … sup A ℝ <
54 dfss3 ⊢ A ⊆ M … sup A ℝ < ↔ ∀ j ∈ A j ∈ M … sup A ℝ <
55 53 54 sylibr ⊢ φ ∧ ¬ A = ∅ → A ⊆ M … sup A ℝ <
56 oveq2 ⊢ k = sup A ℝ < → M … k = M … sup A ℝ <
57 56 sseq2d ⊢ k = sup A ℝ < → A ⊆ M … k ↔ A ⊆ M … sup A ℝ <
58 57 rspcev ⊢ sup A ℝ < ∈ Z ∧ A ⊆ M … sup A ℝ < → ∃ k ∈ Z A ⊆ M … k
59 31 55 58 syl2anc ⊢ φ ∧ ¬ A = ∅ → ∃ k ∈ Z A ⊆ M … k
60 19 59 pm2.61dan ⊢ φ → ∃ k ∈ Z A ⊆ M … k