Metamath Proof Explorer


Theorem prminf

Description: There are an infinite number of primes. Theorem 1.7 in ApostolNT p. 16. (Contributed by Paul Chapman, 28-Nov-2012)

Ref Expression
Assertion prminf ⊢ ℙ ≈ ℕ

Proof

Step Hyp Ref Expression
1 prmssnn ⊢ ℙ ⊆ ℕ
2 prmunb ⊢ n ∈ ℕ → ∃ p ∈ ℙ n < p
3 2 rgen ⊢ ∀ n ∈ ℕ ∃ p ∈ ℙ n < p
4 unben ⊢ ℙ ⊆ ℕ ∧ ∀ n ∈ ℕ ∃ p ∈ ℙ n < p → ℙ ≈ ℕ
5 1 3 4 mp2an ⊢ ℙ ≈ ℕ