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

Theorem coprm 11550
Description: A prime number either divides an integer or is coprime to it, but not both. Theorem 1.8 in [ApostolNT] p. 17. (Contributed by Paul Chapman, 22-Jun-2011.)
Assertion
Ref Expression
coprm  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( -.  P  ||  N  <->  ( P  gcd  N )  =  1 ) )

Proof of Theorem coprm
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 prmz 11520 . . . . . . 7  |-  ( P  e.  Prime  ->  P  e.  ZZ )
2 gcddvds 11382 . . . . . . 7  |-  ( ( P  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( P  gcd  N )  ||  P  /\  ( P  gcd  N ) 
||  N ) )
31, 2sylan 278 . . . . . 6  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  (
( P  gcd  N
)  ||  P  /\  ( P  gcd  N ) 
||  N ) )
43simprd 113 . . . . 5  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( P  gcd  N )  ||  N )
5 breq1 3870 . . . . 5  |-  ( ( P  gcd  N )  =  P  ->  (
( P  gcd  N
)  ||  N  <->  P  ||  N
) )
64, 5syl5ibcom 154 . . . 4  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  (
( P  gcd  N
)  =  P  ->  P  ||  N ) )
76con3d 599 . . 3  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( -.  P  ||  N  ->  -.  ( P  gcd  N
)  =  P ) )
8 0nnn 8547 . . . . . . . . 9  |-  -.  0  e.  NN
9 prmnn 11519 . . . . . . . . . 10  |-  ( P  e.  Prime  ->  P  e.  NN )
10 eleq1 2157 . . . . . . . . . 10  |-  ( P  =  0  ->  ( P  e.  NN  <->  0  e.  NN ) )
119, 10syl5ibcom 154 . . . . . . . . 9  |-  ( P  e.  Prime  ->  ( P  =  0  ->  0  e.  NN ) )
128, 11mtoi 628 . . . . . . . 8  |-  ( P  e.  Prime  ->  -.  P  =  0 )
1312intnanrd 882 . . . . . . 7  |-  ( P  e.  Prime  ->  -.  ( P  =  0  /\  N  =  0 ) )
1413adantr 271 . . . . . 6  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  -.  ( P  =  0  /\  N  =  0
) )
15 gcdn0cl 11381 . . . . . . . 8  |-  ( ( ( P  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( P  =  0  /\  N  =  0 ) )  ->  ( P  gcd  N )  e.  NN )
1615ex 114 . . . . . . 7  |-  ( ( P  e.  ZZ  /\  N  e.  ZZ )  ->  ( -.  ( P  =  0  /\  N  =  0 )  -> 
( P  gcd  N
)  e.  NN ) )
171, 16sylan 278 . . . . . 6  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( -.  ( P  =  0  /\  N  =  0 )  ->  ( P  gcd  N )  e.  NN ) )
1814, 17mpd 13 . . . . 5  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( P  gcd  N )  e.  NN )
193simpld 111 . . . . 5  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( P  gcd  N )  ||  P )
20 isprm2 11526 . . . . . . . 8  |-  ( P  e.  Prime  <->  ( P  e.  ( ZZ>= `  2 )  /\  A. z  e.  NN  ( z  ||  P  ->  ( z  =  1  \/  z  =  P ) ) ) )
2120simprbi 270 . . . . . . 7  |-  ( P  e.  Prime  ->  A. z  e.  NN  ( z  ||  P  ->  ( z  =  1  \/  z  =  P ) ) )
22 breq1 3870 . . . . . . . . 9  |-  ( z  =  ( P  gcd  N )  ->  ( z  ||  P  <->  ( P  gcd  N )  ||  P ) )
23 eqeq1 2101 . . . . . . . . . 10  |-  ( z  =  ( P  gcd  N )  ->  ( z  =  1  <->  ( P  gcd  N )  =  1 ) )
24 eqeq1 2101 . . . . . . . . . 10  |-  ( z  =  ( P  gcd  N )  ->  ( z  =  P  <->  ( P  gcd  N )  =  P ) )
2523, 24orbi12d 745 . . . . . . . . 9  |-  ( z  =  ( P  gcd  N )  ->  ( (
z  =  1  \/  z  =  P )  <-> 
( ( P  gcd  N )  =  1  \/  ( P  gcd  N
)  =  P ) ) )
2622, 25imbi12d 233 . . . . . . . 8  |-  ( z  =  ( P  gcd  N )  ->  ( (
z  ||  P  ->  ( z  =  1  \/  z  =  P ) )  <->  ( ( P  gcd  N )  ||  P  ->  ( ( P  gcd  N )  =  1  \/  ( P  gcd  N )  =  P ) ) ) )
2726rspcv 2732 . . . . . . 7  |-  ( ( P  gcd  N )  e.  NN  ->  ( A. z  e.  NN  ( z  ||  P  ->  ( z  =  1  \/  z  =  P ) )  ->  (
( P  gcd  N
)  ||  P  ->  ( ( P  gcd  N
)  =  1  \/  ( P  gcd  N
)  =  P ) ) ) )
2821, 27syl5com 29 . . . . . 6  |-  ( P  e.  Prime  ->  ( ( P  gcd  N )  e.  NN  ->  (
( P  gcd  N
)  ||  P  ->  ( ( P  gcd  N
)  =  1  \/  ( P  gcd  N
)  =  P ) ) ) )
2928adantr 271 . . . . 5  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  (
( P  gcd  N
)  e.  NN  ->  ( ( P  gcd  N
)  ||  P  ->  ( ( P  gcd  N
)  =  1  \/  ( P  gcd  N
)  =  P ) ) ) )
3018, 19, 29mp2d 47 . . . 4  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  (
( P  gcd  N
)  =  1  \/  ( P  gcd  N
)  =  P ) )
31 biorf 701 . . . . 5  |-  ( -.  ( P  gcd  N
)  =  P  -> 
( ( P  gcd  N )  =  1  <->  (
( P  gcd  N
)  =  P  \/  ( P  gcd  N )  =  1 ) ) )
32 orcom 685 . . . . 5  |-  ( ( ( P  gcd  N
)  =  P  \/  ( P  gcd  N )  =  1 )  <->  ( ( P  gcd  N )  =  1  \/  ( P  gcd  N )  =  P ) )
3331, 32syl6bb 195 . . . 4  |-  ( -.  ( P  gcd  N
)  =  P  -> 
( ( P  gcd  N )  =  1  <->  (
( P  gcd  N
)  =  1  \/  ( P  gcd  N
)  =  P ) ) )
3430, 33syl5ibrcom 156 . . 3  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( -.  ( P  gcd  N
)  =  P  -> 
( P  gcd  N
)  =  1 ) )
357, 34syld 45 . 2  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( -.  P  ||  N  -> 
( P  gcd  N
)  =  1 ) )
36 iddvds 11236 . . . . . . 7  |-  ( P  e.  ZZ  ->  P  ||  P )
371, 36syl 14 . . . . . 6  |-  ( P  e.  Prime  ->  P  ||  P )
3837adantr 271 . . . . 5  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  P  ||  P )
39 dvdslegcd 11383 . . . . . . . . 9  |-  ( ( ( P  e.  ZZ  /\  P  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( P  =  0  /\  N  =  0 ) )  -> 
( ( P  ||  P  /\  P  ||  N
)  ->  P  <_  ( P  gcd  N ) ) )
4039ex 114 . . . . . . . 8  |-  ( ( P  e.  ZZ  /\  P  e.  ZZ  /\  N  e.  ZZ )  ->  ( -.  ( P  =  0  /\  N  =  0 )  ->  ( ( P  ||  P  /\  P  ||  N )  ->  P  <_  ( P  gcd  N
) ) ) )
41403anidm12 1238 . . . . . . 7  |-  ( ( P  e.  ZZ  /\  N  e.  ZZ )  ->  ( -.  ( P  =  0  /\  N  =  0 )  -> 
( ( P  ||  P  /\  P  ||  N
)  ->  P  <_  ( P  gcd  N ) ) ) )
421, 41sylan 278 . . . . . 6  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( -.  ( P  =  0  /\  N  =  0 )  ->  ( ( P  ||  P  /\  P  ||  N )  ->  P  <_  ( P  gcd  N
) ) ) )
4314, 42mpd 13 . . . . 5  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  (
( P  ||  P  /\  P  ||  N )  ->  P  <_  ( P  gcd  N ) ) )
4438, 43mpand 421 . . . 4  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( P  ||  N  ->  P  <_  ( P  gcd  N
) ) )
45 prmgt1 11540 . . . . . 6  |-  ( P  e.  Prime  ->  1  < 
P )
4645adantr 271 . . . . 5  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  1  <  P )
471zred 8967 . . . . . . 7  |-  ( P  e.  Prime  ->  P  e.  RR )
4847adantr 271 . . . . . 6  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  P  e.  RR )
4918nnred 8533 . . . . . 6  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( P  gcd  N )  e.  RR )
50 1re 7584 . . . . . . 7  |-  1  e.  RR
51 ltletr 7671 . . . . . . 7  |-  ( ( 1  e.  RR  /\  P  e.  RR  /\  ( P  gcd  N )  e.  RR )  ->  (
( 1  <  P  /\  P  <_  ( P  gcd  N ) )  ->  1  <  ( P  gcd  N ) ) )
5250, 51mp3an1 1267 . . . . . 6  |-  ( ( P  e.  RR  /\  ( P  gcd  N )  e.  RR )  -> 
( ( 1  < 
P  /\  P  <_  ( P  gcd  N ) )  ->  1  <  ( P  gcd  N ) ) )
5348, 49, 52syl2anc 404 . . . . 5  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  (
( 1  <  P  /\  P  <_  ( P  gcd  N ) )  ->  1  <  ( P  gcd  N ) ) )
5446, 53mpand 421 . . . 4  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( P  <_  ( P  gcd  N )  ->  1  <  ( P  gcd  N ) ) )
55 ltne 7667 . . . . . 6  |-  ( ( 1  e.  RR  /\  1  <  ( P  gcd  N ) )  ->  ( P  gcd  N )  =/=  1 )
5650, 55mpan 416 . . . . 5  |-  ( 1  <  ( P  gcd  N )  ->  ( P  gcd  N )  =/=  1
)
5756a1i 9 . . . 4  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  (
1  <  ( P  gcd  N )  ->  ( P  gcd  N )  =/=  1 ) )
5844, 54, 573syld 57 . . 3  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( P  ||  N  ->  ( P  gcd  N )  =/=  1 ) )
5958necon2bd 2320 . 2  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  (
( P  gcd  N
)  =  1  ->  -.  P  ||  N ) )
6035, 59impbid 128 1  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( -.  P  ||  N  <->  ( P  gcd  N )  =  1 ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    <-> wb 104    \/ wo 667    /\ w3a 927    = wceq 1296    e. wcel 1445    =/= wne 2262   A.wral 2370   class class class wbr 3867   ` cfv 5049  (class class class)co 5690   RRcr 7446   0cc0 7447   1c1 7448    < clt 7619    <_ cle 7620   NNcn 8520   2c2 8571   ZZcz 8848   ZZ>=cuz 9118    || cdvds 11223    gcd cgcd 11365   Primecprime 11516
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 582  ax-in2 583  ax-io 668  ax-5 1388  ax-7 1389  ax-gen 1390  ax-ie1 1434  ax-ie2 1435  ax-8 1447  ax-10 1448  ax-11 1449  ax-i12 1450  ax-bndl 1451  ax-4 1452  ax-13 1456  ax-14 1457  ax-17 1471  ax-i9 1475  ax-ial 1479  ax-i5r 1480  ax-ext 2077  ax-coll 3975  ax-sep 3978  ax-nul 3986  ax-pow 4030  ax-pr 4060  ax-un 4284  ax-setind 4381  ax-iinf 4431  ax-cnex 7533  ax-resscn 7534  ax-1cn 7535  ax-1re 7536  ax-icn 7537  ax-addcl 7538  ax-addrcl 7539  ax-mulcl 7540  ax-mulrcl 7541  ax-addcom 7542  ax-mulcom 7543  ax-addass 7544  ax-mulass 7545  ax-distr 7546  ax-i2m1 7547  ax-0lt1 7548  ax-1rid 7549  ax-0id 7550  ax-rnegex 7551  ax-precex 7552  ax-cnre 7553  ax-pre-ltirr 7554  ax-pre-ltwlin 7555  ax-pre-lttrn 7556  ax-pre-apti 7557  ax-pre-ltadd 7558  ax-pre-mulgt0 7559  ax-pre-mulext 7560  ax-arch 7561  ax-caucvg 7562
This theorem depends on definitions:  df-bi 116  df-dc 784  df-3or 928  df-3an 929  df-tru 1299  df-fal 1302  df-nf 1402  df-sb 1700  df-eu 1958  df-mo 1959  df-clab 2082  df-cleq 2088  df-clel 2091  df-nfc 2224  df-ne 2263  df-nel 2358  df-ral 2375  df-rex 2376  df-reu 2377  df-rmo 2378  df-rab 2379  df-v 2635  df-sbc 2855  df-csb 2948  df-dif 3015  df-un 3017  df-in 3019  df-ss 3026  df-nul 3303  df-if 3414  df-pw 3451  df-sn 3472  df-pr 3473  df-op 3475  df-uni 3676  df-int 3711  df-iun 3754  df-br 3868  df-opab 3922  df-mpt 3923  df-tr 3959  df-id 4144  df-po 4147  df-iso 4148  df-iord 4217  df-on 4219  df-ilim 4220  df-suc 4222  df-iom 4434  df-xp 4473  df-rel 4474  df-cnv 4475  df-co 4476  df-dm 4477  df-rn 4478  df-res 4479  df-ima 4480  df-iota 5014  df-fun 5051  df-fn 5052  df-f 5053  df-f1 5054  df-fo 5055  df-f1o 5056  df-fv 5057  df-riota 5646  df-ov 5693  df-oprab 5694  df-mpt2 5695  df-1st 5949  df-2nd 5950  df-recs 6108  df-frec 6194  df-1o 6219  df-2o 6220  df-er 6332  df-en 6538  df-sup 6759  df-pnf 7621  df-mnf 7622  df-xr 7623  df-ltxr 7624  df-le 7625  df-sub 7752  df-neg 7753  df-reap 8149  df-ap 8156  df-div 8237  df-inn 8521  df-2 8579  df-3 8580  df-4 8581  df-n0 8772  df-z 8849  df-uz 9119  df-q 9204  df-rp 9234  df-fz 9574  df-fzo 9703  df-fl 9826  df-mod 9879  df-seqfrec 10001  df-exp 10070  df-cj 10391  df-re 10392  df-im 10393  df-rsqrt 10546  df-abs 10547  df-dvds 11224  df-gcd 11366  df-prm 11517
This theorem is referenced by:  prmrp  11551  euclemma  11552  cncongrprm  11563  isoddgcd1  11565  phiprmpw  11625
  Copyright terms: Public domain W3C validator