Metamath Proof Explorer


Theorem nninfnub

Description: An infinite set of positive integers is unbounded above. (Contributed by Jeff Madsen, 2-Sep-2009) (Revised by Mario Carneiro, 28-Feb-2014)

Ref Expression
Assertion nninfnub ⊢ A ⊆ ℕ ∧ ¬ A ∈ Fin ∧ B ∈ ℕ → x ∈ A | B < x ≠ ∅

Proof

Step Hyp Ref Expression
1 eq0 ⊢ x ∈ A | B < x = ∅ ↔ ∀ y ¬ y ∈ x ∈ A | B < x
2 breq2 ⊢ x = y → B < x ↔ B < y
3 2 elrab ⊢ y ∈ x ∈ A | B < x ↔ y ∈ A ∧ B < y
4 3 notbii ⊢ ¬ y ∈ x ∈ A | B < x ↔ ¬ y ∈ A ∧ B < y
5 imnan ⊢ y ∈ A → ¬ B < y ↔ ¬ y ∈ A ∧ B < y
6 4 5 sylbb2 ⊢ ¬ y ∈ x ∈ A | B < x → y ∈ A → ¬ B < y
7 6 alimi ⊢ ∀ y ¬ y ∈ x ∈ A | B < x → ∀ y y ∈ A → ¬ B < y
8 7 ralrid ⊢ ∀ y ¬ y ∈ x ∈ A | B < x → ∀ y ∈ A ¬ B < y
9 ssel2 ⊢ A ⊆ ℕ ∧ y ∈ A → y ∈ ℕ
10 9 nnred ⊢ A ⊆ ℕ ∧ y ∈ A → y ∈ ℝ
11 10 adantlr ⊢ A ⊆ ℕ ∧ B ∈ ℕ ∧ y ∈ A → y ∈ ℝ
12 nnre ⊢ B ∈ ℕ → B ∈ ℝ
13 12 ad2antlr ⊢ A ⊆ ℕ ∧ B ∈ ℕ ∧ y ∈ A → B ∈ ℝ
14 lenlt ⊢ y ∈ ℝ ∧ B ∈ ℝ → y ≤ B ↔ ¬ B < y
15 14 biimprd ⊢ y ∈ ℝ ∧ B ∈ ℝ → ¬ B < y → y ≤ B
16 11 13 15 syl2anc ⊢ A ⊆ ℕ ∧ B ∈ ℕ ∧ y ∈ A → ¬ B < y → y ≤ B
17 16 ralimdva ⊢ A ⊆ ℕ ∧ B ∈ ℕ → ∀ y ∈ A ¬ B < y → ∀ y ∈ A y ≤ B
18 fzfi ⊢ 0 … B ∈ Fin
19 9 nnnn0d ⊢ A ⊆ ℕ ∧ y ∈ A → y ∈ ℕ 0
20 19 adantlr ⊢ A ⊆ ℕ ∧ B ∈ ℕ ∧ y ∈ A → y ∈ ℕ 0
21 20 adantr ⊢ A ⊆ ℕ ∧ B ∈ ℕ ∧ y ∈ A ∧ y ≤ B → y ∈ ℕ 0
22 nnnn0 ⊢ B ∈ ℕ → B ∈ ℕ 0
23 22 ad3antlr ⊢ A ⊆ ℕ ∧ B ∈ ℕ ∧ y ∈ A ∧ y ≤ B → B ∈ ℕ 0
24 simpr ⊢ A ⊆ ℕ ∧ B ∈ ℕ ∧ y ∈ A ∧ y ≤ B → y ≤ B
25 21 23 24 3jca ⊢ A ⊆ ℕ ∧ B ∈ ℕ ∧ y ∈ A ∧ y ≤ B → y ∈ ℕ 0 ∧ B ∈ ℕ 0 ∧ y ≤ B
26 25 ex ⊢ A ⊆ ℕ ∧ B ∈ ℕ ∧ y ∈ A → y ≤ B → y ∈ ℕ 0 ∧ B ∈ ℕ 0 ∧ y ≤ B
27 elfz2nn0 ⊢ y ∈ 0 … B ↔ y ∈ ℕ 0 ∧ B ∈ ℕ 0 ∧ y ≤ B
28 26 27 imbitrrdi ⊢ A ⊆ ℕ ∧ B ∈ ℕ ∧ y ∈ A → y ≤ B → y ∈ 0 … B
29 28 ralimdva ⊢ A ⊆ ℕ ∧ B ∈ ℕ → ∀ y ∈ A y ≤ B → ∀ y ∈ A y ∈ 0 … B
30 29 imp ⊢ A ⊆ ℕ ∧ B ∈ ℕ ∧ ∀ y ∈ A y ≤ B → ∀ y ∈ A y ∈ 0 … B
31 dfss3 ⊢ A ⊆ 0 … B ↔ ∀ y ∈ A y ∈ 0 … B
32 30 31 sylibr ⊢ A ⊆ ℕ ∧ B ∈ ℕ ∧ ∀ y ∈ A y ≤ B → A ⊆ 0 … B
33 ssfi ⊢ 0 … B ∈ Fin ∧ A ⊆ 0 … B → A ∈ Fin
34 18 32 33 sylancr ⊢ A ⊆ ℕ ∧ B ∈ ℕ ∧ ∀ y ∈ A y ≤ B → A ∈ Fin
35 34 ex ⊢ A ⊆ ℕ ∧ B ∈ ℕ → ∀ y ∈ A y ≤ B → A ∈ Fin
36 17 35 syld ⊢ A ⊆ ℕ ∧ B ∈ ℕ → ∀ y ∈ A ¬ B < y → A ∈ Fin
37 8 36 syl5 ⊢ A ⊆ ℕ ∧ B ∈ ℕ → ∀ y ¬ y ∈ x ∈ A | B < x → A ∈ Fin
38 1 37 biimtrid ⊢ A ⊆ ℕ ∧ B ∈ ℕ → x ∈ A | B < x = ∅ → A ∈ Fin
39 38 necon3bd ⊢ A ⊆ ℕ ∧ B ∈ ℕ → ¬ A ∈ Fin → x ∈ A | B < x ≠ ∅
40 39 imp ⊢ A ⊆ ℕ ∧ B ∈ ℕ ∧ ¬ A ∈ Fin → x ∈ A | B < x ≠ ∅
41 40 an32s ⊢ A ⊆ ℕ ∧ ¬ A ∈ Fin ∧ B ∈ ℕ → x ∈ A | B < x ≠ ∅
42 41 3impa ⊢ A ⊆ ℕ ∧ ¬ A ∈ Fin ∧ B ∈ ℕ → x ∈ A | B < x ≠ ∅