Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > isprm | Structured version Visualization version GIF version |
Description: The predicate "is a prime number". A prime number is a positive integer with exactly two positive divisors. (Contributed by Paul Chapman, 22-Jun-2011.) |
Ref | Expression |
---|---|
isprm | ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ ℕ ∧ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑃} ≈ 2o)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | breq2 5074 | . . . 4 ⊢ (𝑝 = 𝑃 → (𝑛 ∥ 𝑝 ↔ 𝑛 ∥ 𝑃)) | |
2 | 1 | rabbidv 3404 | . . 3 ⊢ (𝑝 = 𝑃 → {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑝} = {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑃}) |
3 | 2 | breq1d 5080 | . 2 ⊢ (𝑝 = 𝑃 → ({𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑝} ≈ 2o ↔ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑃} ≈ 2o)) |
4 | df-prm 16305 | . 2 ⊢ ℙ = {𝑝 ∈ ℕ ∣ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑝} ≈ 2o} | |
5 | 3, 4 | elrab2 3620 | 1 ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ ℕ ∧ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑃} ≈ 2o)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 {crab 3067 class class class wbr 5070 2oc2o 8261 ≈ cen 8688 ℕcn 11903 ∥ cdvds 15891 ℙcprime 16304 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-br 5071 df-prm 16305 |
This theorem is referenced by: prmnn 16307 1nprm 16312 isprm2 16315 |
Copyright terms: Public domain | W3C validator |