Theorem isprm 12887

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	|- ( P e. Prime <-> ( P e. NN /\ { n e. NN | n || P } ~~ 2o ) )

Distinct variable group:   P, n

Proof of Theorem isprm

Dummy variable p is distinct from all other variables.

Step	Hyp	Ref	Expression
1		breq2 4134	. . . 4 |- ( p = P -> ( n || p <-> n || P ) )
2	1	rabbidv 2810	. . 3 |- ( p = P -> { n e. NN | n || p } = { n e. NN | n || P } )
3	2	breq1d 4140	. 2 |- ( p = P -> ( { n e. NN | n || p } ~~ 2o <-> { n e. NN | n || P } ~~ 2o ) )
4		df-prm 12886	. 2 |- Prime = { p e. NN | { n e. NN | n || p } ~~ 2o }
5	3, 4	elrab2 2985	1 |- ( P e. Prime <-> ( P e. NN /\ { n e. NN | n || P } ~~ 2o ) )

This proof depends on syntax axioms:   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   {crab 2532   class class class wbr 4130   2oc2o 6681   ~~ cen 7020   NNcn 9304   || cdvds 12554   Primecprime 12885

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rab 2537  df-v 2823  df-un 3224  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-prm 12886

This theorem is used by:  prmnn  12888  1nprm  12892  isprm2  12895