Metamath Proof Explorer


Definition df-prm

Description: Define the set of prime numbers. (Contributed by Paul Chapman, 22-Jun-2011)

Ref Expression
Assertion df-prm ⊢ ℙ = p ∈ ℕ | n ∈ ℕ | n ∥ p ≈ 2 𝑜

Detailed syntax breakdown

Step Hyp Ref Expression
0 cprime class ℙ
1 vp setvar p
2 cn class ℕ
3 vn setvar n
4 3 cv setvar n
5 cdvds class ∥
6 1 cv setvar p
7 4 6 5 wbr wff n ∥ p
8 7 3 2 crab class n ∈ ℕ | n ∥ p
9 cen class ≈
10 c2o class 2 𝑜
11 8 10 9 wbr wff n ∈ ℕ | n ∥ p ≈ 2 𝑜
12 11 1 2 crab class p ∈ ℕ | n ∈ ℕ | n ∥ p ≈ 2 𝑜
13 0 12 wceq wff ℙ = p ∈ ℕ | n ∈ ℕ | n ∥ p ≈ 2 𝑜