Metamath Proof Explorer


Theorem unben

Description: An unbounded set of positive integers is infinite. (Contributed by NM, 5-May-2005) (Revised by Mario Carneiro, 15-Sep-2013)

Ref Expression
Assertion unben ⊢ A ⊆ ℕ ∧ ∀ m ∈ ℕ ∃ n ∈ A m < n → A ≈ ℕ

Proof

Step Hyp Ref Expression
1 eqid ⊢ rec ⁡ x ∈ V ⟼ x + 1 1 ↾ ω = rec ⁡ x ∈ V ⟼ x + 1 1 ↾ ω
2 1 unbenlem ⊢ A ⊆ ℕ ∧ ∀ m ∈ ℕ ∃ n ∈ A m < n → A ≈ ω
3 nnenom ⊢ ℕ ≈ ω
4 3 ensymi ⊢ ω ≈ ℕ
5 entr ⊢ A ≈ ω ∧ ω ≈ ℕ → A ≈ ℕ
6 2 4 5 sylancl ⊢ A ⊆ ℕ ∧ ∀ m ∈ ℕ ∃ n ∈ A m < n → A ≈ ℕ