ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  isprm4 Unicode version

Theorem isprm4 12656
Description: The predicate "is a prime number". A prime number is an integer greater than or equal to 2 whose only divisor greater than or equal to 2 is itself. (Contributed by Paul Chapman, 26-Oct-2012.)
Assertion
Ref Expression
isprm4  |-  ( P  e.  Prime  <->  ( P  e.  ( ZZ>= `  2 )  /\  A. z  e.  (
ZZ>= `  2 ) ( z  ||  P  -> 
z  =  P ) ) )
Distinct variable group:    z, P

Proof of Theorem isprm4
StepHypRef Expression
1 isprm2 12654 . 2  |-  ( P  e.  Prime  <->  ( P  e.  ( ZZ>= `  2 )  /\  A. z  e.  NN  ( z  ||  P  ->  ( z  =  1  \/  z  =  P ) ) ) )
2 eluz2nn 9773 . . . . . . . 8  |-  ( z  e.  ( ZZ>= `  2
)  ->  z  e.  NN )
32pm4.71ri 392 . . . . . . 7  |-  ( z  e.  ( ZZ>= `  2
)  <->  ( z  e.  NN  /\  z  e.  ( ZZ>= `  2 )
) )
43imbi1i 238 . . . . . 6  |-  ( ( z  e.  ( ZZ>= ` 
2 )  ->  (
z  ||  P  ->  z  =  P ) )  <-> 
( ( z  e.  NN  /\  z  e.  ( ZZ>= `  2 )
)  ->  ( z  ||  P  ->  z  =  P ) ) )
5 impexp 263 . . . . . 6  |-  ( ( ( z  e.  NN  /\  z  e.  ( ZZ>= ` 
2 ) )  -> 
( z  ||  P  ->  z  =  P ) )  <->  ( z  e.  NN  ->  ( z  e.  ( ZZ>= `  2 )  ->  ( z  ||  P  ->  z  =  P ) ) ) )
64, 5bitri 184 . . . . 5  |-  ( ( z  e.  ( ZZ>= ` 
2 )  ->  (
z  ||  P  ->  z  =  P ) )  <-> 
( z  e.  NN  ->  ( z  e.  (
ZZ>= `  2 )  -> 
( z  ||  P  ->  z  =  P ) ) ) )
7 eluz2b3 9811 . . . . . . . 8  |-  ( z  e.  ( ZZ>= `  2
)  <->  ( z  e.  NN  /\  z  =/=  1 ) )
87imbi1i 238 . . . . . . 7  |-  ( ( z  e.  ( ZZ>= ` 
2 )  ->  (
z  ||  P  ->  z  =  P ) )  <-> 
( ( z  e.  NN  /\  z  =/=  1 )  ->  (
z  ||  P  ->  z  =  P ) ) )
9 impexp 263 . . . . . . . 8  |-  ( ( ( z  e.  NN  /\  z  =/=  1 )  ->  ( z  ||  P  ->  z  =  P ) )  <->  ( z  e.  NN  ->  ( z  =/=  1  ->  ( z 
||  P  ->  z  =  P ) ) ) )
10 bi2.04 248 . . . . . . . . . 10  |-  ( ( z  =/=  1  -> 
( z  ||  P  ->  z  =  P ) )  <->  ( z  ||  P  ->  ( z  =/=  1  ->  z  =  P ) ) )
11 df-ne 2401 . . . . . . . . . . . . 13  |-  ( z  =/=  1  <->  -.  z  =  1 )
1211imbi1i 238 . . . . . . . . . . . 12  |-  ( ( z  =/=  1  -> 
z  =  P )  <-> 
( -.  z  =  1  ->  z  =  P ) )
13 nnz 9476 . . . . . . . . . . . . . 14  |-  ( z  e.  NN  ->  z  e.  ZZ )
14 1zzd 9484 . . . . . . . . . . . . . 14  |-  ( z  e.  NN  ->  1  e.  ZZ )
15 zdceq 9533 . . . . . . . . . . . . . 14  |-  ( ( z  e.  ZZ  /\  1  e.  ZZ )  -> DECID  z  =  1 )
1613, 14, 15syl2anc 411 . . . . . . . . . . . . 13  |-  ( z  e.  NN  -> DECID  z  =  1
)
17 dfordc 897 . . . . . . . . . . . . 13  |-  (DECID  z  =  1  ->  ( (
z  =  1  \/  z  =  P )  <-> 
( -.  z  =  1  ->  z  =  P ) ) )
1816, 17syl 14 . . . . . . . . . . . 12  |-  ( z  e.  NN  ->  (
( z  =  1  \/  z  =  P )  <->  ( -.  z  =  1  ->  z  =  P ) ) )
1912, 18bitr4id 199 . . . . . . . . . . 11  |-  ( z  e.  NN  ->  (
( z  =/=  1  ->  z  =  P )  <-> 
( z  =  1  \/  z  =  P ) ) )
2019imbi2d 230 . . . . . . . . . 10  |-  ( z  e.  NN  ->  (
( z  ||  P  ->  ( z  =/=  1  ->  z  =  P ) )  <->  ( z  ||  P  ->  ( z  =  1  \/  z  =  P ) ) ) )
2110, 20bitrid 192 . . . . . . . . 9  |-  ( z  e.  NN  ->  (
( z  =/=  1  ->  ( z  ||  P  ->  z  =  P ) )  <->  ( z  ||  P  ->  ( z  =  1  \/  z  =  P ) ) ) )
2221imbi2d 230 . . . . . . . 8  |-  ( z  e.  NN  ->  (
( z  e.  NN  ->  ( z  =/=  1  ->  ( z  ||  P  ->  z  =  P ) ) )  <->  ( z  e.  NN  ->  ( z  ||  P  ->  ( z  =  1  \/  z  =  P ) ) ) ) )
239, 22bitrid 192 . . . . . . 7  |-  ( z  e.  NN  ->  (
( ( z  e.  NN  /\  z  =/=  1 )  ->  (
z  ||  P  ->  z  =  P ) )  <-> 
( z  e.  NN  ->  ( z  ||  P  ->  ( z  =  1  \/  z  =  P ) ) ) ) )
248, 23bitrid 192 . . . . . 6  |-  ( z  e.  NN  ->  (
( z  e.  (
ZZ>= `  2 )  -> 
( z  ||  P  ->  z  =  P ) )  <->  ( z  e.  NN  ->  ( z  ||  P  ->  ( z  =  1  \/  z  =  P ) ) ) ) )
2524pm5.74i 180 . . . . 5  |-  ( ( z  e.  NN  ->  ( z  e.  ( ZZ>= ` 
2 )  ->  (
z  ||  P  ->  z  =  P ) ) )  <->  ( z  e.  NN  ->  ( z  e.  NN  ->  ( z  ||  P  ->  ( z  =  1  \/  z  =  P ) ) ) ) )
26 pm5.4 249 . . . . 5  |-  ( ( z  e.  NN  ->  ( z  e.  NN  ->  ( z  ||  P  -> 
( z  =  1  \/  z  =  P ) ) ) )  <-> 
( z  e.  NN  ->  ( z  ||  P  ->  ( z  =  1  \/  z  =  P ) ) ) )
276, 25, 263bitri 206 . . . 4  |-  ( ( z  e.  ( ZZ>= ` 
2 )  ->  (
z  ||  P  ->  z  =  P ) )  <-> 
( z  e.  NN  ->  ( z  ||  P  ->  ( z  =  1  \/  z  =  P ) ) ) )
2827ralbii2 2540 . . 3  |-  ( A. z  e.  ( ZZ>= ` 
2 ) ( z 
||  P  ->  z  =  P )  <->  A. z  e.  NN  ( z  ||  P  ->  ( z  =  1  \/  z  =  P ) ) )
2928anbi2i 457 . 2  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  A. z  e.  ( ZZ>= ` 
2 ) ( z 
||  P  ->  z  =  P ) )  <->  ( P  e.  ( ZZ>= `  2 )  /\  A. z  e.  NN  ( z  ||  P  ->  ( z  =  1  \/  z  =  P ) ) ) )
301, 29bitr4i 187 1  |-  ( P  e.  Prime  <->  ( P  e.  ( ZZ>= `  2 )  /\  A. z  e.  (
ZZ>= `  2 ) ( z  ||  P  -> 
z  =  P ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 713  DECID wdc 839    = wceq 1395    e. wcel 2200    =/= wne 2400   A.wral 2508   class class class wbr 4083   ` cfv 5318   1c1 8011   NNcn 9121   2c2 9172   ZZcz 9457   ZZ>=cuz 9733    || cdvds 12313   Primecprime 12644
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680  ax-cnex 8101  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-icn 8105  ax-addcl 8106  ax-addrcl 8107  ax-mulcl 8108  ax-mulrcl 8109  ax-addcom 8110  ax-mulcom 8111  ax-addass 8112  ax-mulass 8113  ax-distr 8114  ax-i2m1 8115  ax-0lt1 8116  ax-1rid 8117  ax-0id 8118  ax-rnegex 8119  ax-precex 8120  ax-cnre 8121  ax-pre-ltirr 8122  ax-pre-ltwlin 8123  ax-pre-lttrn 8124  ax-pre-apti 8125  ax-pre-ltadd 8126  ax-pre-mulgt0 8127  ax-pre-mulext 8128  ax-arch 8129  ax-caucvg 8130
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4384  df-po 4387  df-iso 4388  df-iord 4457  df-on 4459  df-ilim 4460  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-1st 6292  df-2nd 6293  df-recs 6457  df-frec 6543  df-1o 6568  df-2o 6569  df-er 6688  df-en 6896  df-pnf 8194  df-mnf 8195  df-xr 8196  df-ltxr 8197  df-le 8198  df-sub 8330  df-neg 8331  df-reap 8733  df-ap 8740  df-div 8831  df-inn 9122  df-2 9180  df-3 9181  df-4 9182  df-n0 9381  df-z 9458  df-uz 9734  df-q 9827  df-rp 9862  df-seqfrec 10682  df-exp 10773  df-cj 11368  df-re 11369  df-im 11370  df-rsqrt 11524  df-abs 11525  df-dvds 12314  df-prm 12645
This theorem is referenced by:  nprm  12660  prmuz2  12668  dvdsprm  12674
  Copyright terms: Public domain W3C validator