![]() |
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 5155 | . . . 4 ⊢ (𝑝 = 𝑃 → (𝑛 ∥ 𝑝 ↔ 𝑛 ∥ 𝑃)) | |
2 | 1 | rabbidv 3444 | . . 3 ⊢ (𝑝 = 𝑃 → {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑝} = {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑃}) |
3 | 2 | breq1d 5161 | . 2 ⊢ (𝑝 = 𝑃 → ({𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑝} ≈ 2o ↔ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑃} ≈ 2o)) |
4 | df-prm 16715 | . 2 ⊢ ℙ = {𝑝 ∈ ℕ ∣ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑝} ≈ 2o} | |
5 | 3, 4 | elrab2 3701 | 1 ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ ℕ ∧ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑃} ≈ 2o)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1539 ∈ wcel 2108 {crab 3436 class class class wbr 5151 2oc2o 8508 ≈ cen 8990 ℕcn 12273 ∥ cdvds 16296 ℙcprime 16714 |
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 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2708 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1779 df-sb 2065 df-clab 2715 df-cleq 2729 df-clel 2816 df-rab 3437 df-v 3483 df-dif 3969 df-un 3971 df-ss 3983 df-nul 4343 df-if 4535 df-sn 4635 df-pr 4637 df-op 4641 df-br 5152 df-prm 16715 |
This theorem is referenced by: prmnn 16717 1nprm 16722 isprm2 16725 |
Copyright terms: Public domain | W3C validator |