MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  isprm Structured version   Visualization version   GIF version

Theorem isprm 16727
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.)
Assertion
Ref Expression
isprm (𝑃 ∈ ℙ ↔ (𝑃 ∈ ℕ ∧ {𝑛 ∈ ℕ ∣ 𝑛𝑃} ≈ 2o))
Distinct variable group:   𝑃,𝑛

Proof of Theorem isprm
Dummy variable 𝑝 is distinct from all other variables.
StepHypRef Expression
1 breq2 5114 . . . 4 (𝑝 = 𝑃 → (𝑛𝑝𝑛𝑃))
21rabbidv 3430 . . 3 (𝑝 = 𝑃 → {𝑛 ∈ ℕ ∣ 𝑛𝑝} = {𝑛 ∈ ℕ ∣ 𝑛𝑃})
32breq1d 5120 . 2 (𝑝 = 𝑃 → ({𝑛 ∈ ℕ ∣ 𝑛𝑝} ≈ 2o ↔ {𝑛 ∈ ℕ ∣ 𝑛𝑃} ≈ 2o))
4 df-prm 16726 . 2 ℙ = {𝑝 ∈ ℕ ∣ {𝑛 ∈ ℕ ∣ 𝑛𝑝} ≈ 2o}
53, 4elrab2 3663 1 (𝑃 ∈ ℙ ↔ (𝑃 ∈ ℕ ∧ {𝑛 ∈ ℕ ∣ 𝑛𝑃} ≈ 2o))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 400   = wceq 1567  wcel 2149  {crab 3423   class class class wbr 5110  2oc2o 8443  cen 8936  cn 12229  cdvds 16306  cprime 16725
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-ss 3930  df-nul 4295  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5111  df-prm 16726
This theorem is referenced by:  prmnn  16728  1nprm  16733  isprm2  16736
  Copyright terms: Public domain W3C validator