| 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 5127 | . . . 4 ⊢ (𝑝 = 𝑃 → (𝑛 ∥ 𝑝 ↔ 𝑛 ∥ 𝑃)) | |
| 2 | 1 | rabbidv 3427 | . . 3 ⊢ (𝑝 = 𝑃 → {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑝} = {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑃}) |
| 3 | 2 | breq1d 5133 | . 2 ⊢ (𝑝 = 𝑃 → ({𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑝} ≈ 2o ↔ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑃} ≈ 2o)) |
| 4 | df-prm 16691 | . 2 ⊢ ℙ = {𝑝 ∈ ℕ ∣ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑝} ≈ 2o} | |
| 5 | 3, 4 | elrab2 3678 | 1 ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ ℕ ∧ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑃} ≈ 2o)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1539 ∈ wcel 2107 {crab 3419 class class class wbr 5123 2oc2o 8482 ≈ cen 8964 ℕcn 12248 ∥ cdvds 16272 ℙcprime 16690 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-sb 2064 df-clab 2713 df-cleq 2726 df-clel 2808 df-rab 3420 df-v 3465 df-dif 3934 df-un 3936 df-ss 3948 df-nul 4314 df-if 4506 df-sn 4607 df-pr 4609 df-op 4613 df-br 5124 df-prm 16691 |
| This theorem is referenced by: prmnn 16693 1nprm 16698 isprm2 16701 |
| Copyright terms: Public domain | W3C validator |