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

Theorem isprm 16841
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 5107 . . . 4 (𝑝 = 𝑃 → (𝑛 ∥ 𝑝 ↔ 𝑛 ∥ 𝑃))
21rabbidv 3420 . . 3 (𝑝 = 𝑃 → {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑝} = {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑃})
32breq1d 5113 . 2 (𝑝 = 𝑃 → ({𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑝} ≈ 2o ↔ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑃} ≈ 2o))
4 df-prm 16840 . 2 ℙ = {𝑝 ∈ ℕ ∣ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑝} ≈ 2o}
53, 4elrab2 3649 1 (𝑃 ∈ ℙ ↔ (𝑃 ∈ ℕ ∧ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑃} ≈ 2o))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {crab 3413   class class class wbr 5103  2oc2o 8463   ≈ cen 8963  ℕcn 12328   ∥ cdvds 16415  ℙcprime 16839
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-prm 16840
This theorem is used by:  prmnn  16842  1nprm  16847  isprm2  16850
  Copyright terms: Public domain W3C validator