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

Theorem isprm 15387
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 (𝑃 ∈ ℙ ↔ (𝑃 ∈ ℕ ∧ {𝑛 ∈ ℕ ∣ 𝑛𝑃} ≈ 2𝑜))
Distinct variable group:   𝑃,𝑛

Proof of Theorem isprm
Dummy variable 𝑝 is distinct from all other variables.
StepHypRef Expression
1 breq2 4657 . . . 4 (𝑝 = 𝑃 → (𝑛𝑝𝑛𝑃))
21rabbidv 3189 . . 3 (𝑝 = 𝑃 → {𝑛 ∈ ℕ ∣ 𝑛𝑝} = {𝑛 ∈ ℕ ∣ 𝑛𝑃})
32breq1d 4663 . 2 (𝑝 = 𝑃 → ({𝑛 ∈ ℕ ∣ 𝑛𝑝} ≈ 2𝑜 ↔ {𝑛 ∈ ℕ ∣ 𝑛𝑃} ≈ 2𝑜))
4 df-prm 15386 . 2 ℙ = {𝑝 ∈ ℕ ∣ {𝑛 ∈ ℕ ∣ 𝑛𝑝} ≈ 2𝑜}
53, 4elrab2 3366 1 (𝑃 ∈ ℙ ↔ (𝑃 ∈ ℕ ∧ {𝑛 ∈ ℕ ∣ 𝑛𝑃} ≈ 2𝑜))
Colors of variables: wff setvar class
Syntax hints:  wb 196  wa 384   = wceq 1483  wcel 1990  {crab 2916   class class class wbr 4653  2𝑜c2o 7554  cen 7952  cn 11020  cdvds 14983  cprime 15385
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-prm 15386
This theorem is referenced by:  prmnn  15388  1nprm  15392  isprm2  15395
  Copyright terms: Public domain W3C validator