Metamath Proof Explorer


Theorem ssnnssfz

Description: For any finite subset of NN , find a superset in the form of a set of sequential integers. (Contributed by Thierry Arnoux, 13-Sep-2017)

Ref Expression
Assertion ssnnssfz ⊢ A ∈ 𝒫 ℕ ∩ Fin → ∃ n ∈ ℕ A ⊆ 1 … n

Proof

Step Hyp Ref Expression
1 1nn ⊢ 1 ∈ ℕ
2 simpr ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A = ∅ → A = ∅
3 0ss ⊢ ∅ ⊆ 1 … 1
4 2 3 eqsstrdi ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A = ∅ → A ⊆ 1 … 1
5 oveq2 ⊢ n = 1 → 1 … n = 1 … 1
6 5 sseq2d ⊢ n = 1 → A ⊆ 1 … n ↔ A ⊆ 1 … 1
7 6 rspcev ⊢ 1 ∈ ℕ ∧ A ⊆ 1 … 1 → ∃ n ∈ ℕ A ⊆ 1 … n
8 1 4 7 sylancr ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A = ∅ → ∃ n ∈ ℕ A ⊆ 1 … n
9 elin ⊢ A ∈ 𝒫 ℕ ∩ Fin ↔ A ∈ 𝒫 ℕ ∧ A ∈ Fin
10 9 simplbi ⊢ A ∈ 𝒫 ℕ ∩ Fin → A ∈ 𝒫 ℕ
11 10 adantr ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ → A ∈ 𝒫 ℕ
12 11 elpwid ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ → A ⊆ ℕ
13 nnssre ⊢ ℕ ⊆ ℝ
14 ltso ⊢ < Or ℝ
15 soss ⊢ ℕ ⊆ ℝ → < Or ℝ → < Or ℕ
16 13 14 15 mp2 ⊢ < Or ℕ
17 16 a1i ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ → < Or ℕ
18 9 simprbi ⊢ A ∈ 𝒫 ℕ ∩ Fin → A ∈ Fin
19 18 adantr ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ → A ∈ Fin
20 simpr ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ → A ≠ ∅
21 fisupcl ⊢ < Or ℕ ∧ A ∈ Fin ∧ A ≠ ∅ ∧ A ⊆ ℕ → sup A ℕ < ∈ A
22 17 19 20 12 21 syl13anc ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ → sup A ℕ < ∈ A
23 12 22 sseldd ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ → sup A ℕ < ∈ ℕ
24 12 sselda ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ ∧ x ∈ A → x ∈ ℕ
25 nnuz ⊢ ℕ = ℤ ≥ 1
26 24 25 eleqtrdi ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ ∧ x ∈ A → x ∈ ℤ ≥ 1
27 24 nnzd ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ ∧ x ∈ A → x ∈ ℤ
28 12 adantr ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ ∧ x ∈ A → A ⊆ ℕ
29 22 adantr ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ ∧ x ∈ A → sup A ℕ < ∈ A
30 28 29 sseldd ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ ∧ x ∈ A → sup A ℕ < ∈ ℕ
31 30 nnzd ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ ∧ x ∈ A → sup A ℕ < ∈ ℤ
32 fisup2g ⊢ < Or ℕ ∧ A ∈ Fin ∧ A ≠ ∅ ∧ A ⊆ ℕ → ∃ x ∈ A ∀ y ∈ A ¬ x < y ∧ ∀ y ∈ ℕ y < x → ∃ z ∈ A y < z
33 17 19 20 12 32 syl13anc ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ → ∃ x ∈ A ∀ y ∈ A ¬ x < y ∧ ∀ y ∈ ℕ y < x → ∃ z ∈ A y < z
34 ssrexv ⊢ A ⊆ ℕ → ∃ x ∈ A ∀ y ∈ A ¬ x < y ∧ ∀ y ∈ ℕ y < x → ∃ z ∈ A y < z → ∃ x ∈ ℕ ∀ y ∈ A ¬ x < y ∧ ∀ y ∈ ℕ y < x → ∃ z ∈ A y < z
35 12 33 34 sylc ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ → ∃ x ∈ ℕ ∀ y ∈ A ¬ x < y ∧ ∀ y ∈ ℕ y < x → ∃ z ∈ A y < z
36 17 35 supub ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ → x ∈ A → ¬ sup A ℕ < < x
37 36 imp ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ ∧ x ∈ A → ¬ sup A ℕ < < x
38 24 nnred ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ ∧ x ∈ A → x ∈ ℝ
39 30 nnred ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ ∧ x ∈ A → sup A ℕ < ∈ ℝ
40 38 39 lenltd ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ ∧ x ∈ A → x ≤ sup A ℕ < ↔ ¬ sup A ℕ < < x
41 37 40 mpbird ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ ∧ x ∈ A → x ≤ sup A ℕ <
42 eluz2 ⊢ sup A ℕ < ∈ ℤ ≥ x ↔ x ∈ ℤ ∧ sup A ℕ < ∈ ℤ ∧ x ≤ sup A ℕ <
43 27 31 41 42 syl3anbrc ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ ∧ x ∈ A → sup A ℕ < ∈ ℤ ≥ x
44 eluzfz ⊢ x ∈ ℤ ≥ 1 ∧ sup A ℕ < ∈ ℤ ≥ x → x ∈ 1 … sup A ℕ <
45 26 43 44 syl2anc ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ ∧ x ∈ A → x ∈ 1 … sup A ℕ <
46 45 ex ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ → x ∈ A → x ∈ 1 … sup A ℕ <
47 46 ssrdv ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ → A ⊆ 1 … sup A ℕ <
48 oveq2 ⊢ n = sup A ℕ < → 1 … n = 1 … sup A ℕ <
49 48 sseq2d ⊢ n = sup A ℕ < → A ⊆ 1 … n ↔ A ⊆ 1 … sup A ℕ <
50 49 rspcev ⊢ sup A ℕ < ∈ ℕ ∧ A ⊆ 1 … sup A ℕ < → ∃ n ∈ ℕ A ⊆ 1 … n
51 23 47 50 syl2anc ⊢ A ∈ 𝒫 ℕ ∩ Fin ∧ A ≠ ∅ → ∃ n ∈ ℕ A ⊆ 1 … n
52 8 51 pm2.61dane ⊢ A ∈ 𝒫 ℕ ∩ Fin → ∃ n ∈ ℕ A ⊆ 1 … n