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

Theorem coprm 11858
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 11828 . . . . . . 7  |-  ( P  e.  Prime  ->  P  e.  ZZ )
2 gcddvds 11688 . . . . . . 7  |-  ( ( P  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( P  gcd  N )  ||  P  /\  ( P  gcd  N ) 
||  N ) )
31, 2sylan 281 . . . . . 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 3940 . . . . 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 621 . . 3  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( -.  P  ||  N  ->  -.  ( P  gcd  N
)  =  P ) )
8 0nnn 8771 . . . . . . . . 9  |-  -.  0  e.  NN
9 prmnn 11827 . . . . . . . . . 10  |-  ( P  e.  Prime  ->  P  e.  NN )
10 eleq1 2203 . . . . . . . . . 10  |-  ( P  =  0  ->  ( P  e.  NN  <->  0  e.  NN ) )
119, 10syl5ibcom 154 . . . . . . . . 9  |-  ( P  e.  Prime  ->  ( P  =  0  ->  0  e.  NN ) )
128, 11mtoi 654 . . . . . . . 8  |-  ( P  e.  Prime  ->  -.  P  =  0 )
1312intnanrd 918 . . . . . . 7  |-  ( P  e.  Prime  ->  -.  ( P  =  0  /\  N  =  0 ) )
1413adantr 274 . . . . . 6  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  -.  ( P  =  0  /\  N  =  0
) )
15 gcdn0cl 11687 . . . . . . . 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 281 . . . . . 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 11834 . . . . . . . 8  |-  ( P  e.  Prime  <->  ( P  e.  ( ZZ>= `  2 )  /\  A. z  e.  NN  ( z  ||  P  ->  ( z  =  1  \/  z  =  P ) ) ) )
2120simprbi 273 . . . . . . 7  |-  ( P  e.  Prime  ->  A. z  e.  NN  ( z  ||  P  ->  ( z  =  1  \/  z  =  P ) ) )
22 breq1 3940 . . . . . . . . 9  |-  ( z  =  ( P  gcd  N )  ->  ( z  ||  P  <->  ( P  gcd  N )  ||  P ) )
23 eqeq1 2147 . . . . . . . . . 10  |-  ( z  =  ( P  gcd  N )  ->  ( z  =  1  <->  ( P  gcd  N )  =  1 ) )
24 eqeq1 2147 . . . . . . . . . 10  |-  ( z  =  ( P  gcd  N )  ->  ( z  =  P  <->  ( P  gcd  N )  =  P ) )
2523, 24orbi12d 783 . . . . . . . . 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 2789 . . . . . . 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 274 . . . . 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 734 . . . . 5  |-  ( -.  ( P  gcd  N
)  =  P  -> 
( ( P  gcd  N )  =  1  <->  (
( P  gcd  N
)  =  P  \/  ( P  gcd  N )  =  1 ) ) )
32 orcom 718 . . . . 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 11542 . . . . . . 7  |-  ( P  e.  ZZ  ->  P  ||  P )
371, 36syl 14 . . . . . 6  |-  ( P  e.  Prime  ->  P  ||  P )
3837adantr 274 . . . . 5  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  P  ||  P )
39 dvdslegcd 11689 . . . . . . . . 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 1274 . . . . . . 7  |-  ( ( P  e.  ZZ  /\  N  e.  ZZ )  ->  ( -.  ( P  =  0  /\  N  =  0 )  -> 
( ( P  ||  P  /\  P  ||  N
)  ->  P  <_  ( P  gcd  N ) ) ) )
421, 41sylan 281 . . . . . 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 426 . . . 4  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( P  ||  N  ->  P  <_  ( P  gcd  N
) ) )
45 prmgt1 11848 . . . . . 6  |-  ( P  e.  Prime  ->  1  < 
P )
4645adantr 274 . . . . 5  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  1  <  P )
471zred 9197 . . . . . . 7  |-  ( P  e.  Prime  ->  P  e.  RR )
4847adantr 274 . . . . . 6  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  P  e.  RR )
4918nnred 8757 . . . . . 6  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( P  gcd  N )  e.  RR )
50 1re 7789 . . . . . . 7  |-  1  e.  RR
51 ltletr 7877 . . . . . . 7  |-  ( ( 1  e.  RR  /\  P  e.  RR  /\  ( P  gcd  N )  e.  RR )  ->  (
( 1  <  P  /\  P  <_  ( P  gcd  N ) )  ->  1  <  ( P  gcd  N ) ) )
5250, 51mp3an1 1303 . . . . . 6  |-  ( ( P  e.  RR  /\  ( P  gcd  N )  e.  RR )  -> 
( ( 1  < 
P  /\  P  <_  ( P  gcd  N ) )  ->  1  <  ( P  gcd  N ) ) )
5348, 49, 52syl2anc 409 . . . . 5  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  (
( 1  <  P  /\  P  <_  ( P  gcd  N ) )  ->  1  <  ( P  gcd  N ) ) )
5446, 53mpand 426 . . . 4  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( P  <_  ( P  gcd  N )  ->  1  <  ( P  gcd  N ) ) )
55 ltne 7873 . . . . . 6  |-  ( ( 1  e.  RR  /\  1  <  ( P  gcd  N ) )  ->  ( P  gcd  N )  =/=  1 )
5650, 55mpan 421 . . . . 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 2367 . 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 698    /\ w3a 963    = wceq 1332    e. wcel 1481    =/= wne 2309   A.wral 2417   class class class wbr 3937   ` cfv 5131  (class class class)co 5782   RRcr 7643   0cc0 7644   1c1 7645    < clt 7824    <_ cle 7825   NNcn 8744   2c2 8795   ZZcz 9078   ZZ>=cuz 9350    || cdvds 11529    gcd cgcd 11671   Primecprime 11824
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-coll 4051  ax-sep 4054  ax-nul 4062  ax-pow 4106  ax-pr 4139  ax-un 4363  ax-setind 4460  ax-iinf 4510  ax-cnex 7735  ax-resscn 7736  ax-1cn 7737  ax-1re 7738  ax-icn 7739  ax-addcl 7740  ax-addrcl 7741  ax-mulcl 7742  ax-mulrcl 7743  ax-addcom 7744  ax-mulcom 7745  ax-addass 7746  ax-mulass 7747  ax-distr 7748  ax-i2m1 7749  ax-0lt1 7750  ax-1rid 7751  ax-0id 7752  ax-rnegex 7753  ax-precex 7754  ax-cnre 7755  ax-pre-ltirr 7756  ax-pre-ltwlin 7757  ax-pre-lttrn 7758  ax-pre-apti 7759  ax-pre-ltadd 7760  ax-pre-mulgt0 7761  ax-pre-mulext 7762  ax-arch 7763  ax-caucvg 7764
This theorem depends on definitions:  df-bi 116  df-dc 821  df-3or 964  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-nel 2405  df-ral 2422  df-rex 2423  df-reu 2424  df-rmo 2425  df-rab 2426  df-v 2691  df-sbc 2914  df-csb 3008  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-nul 3369  df-if 3480  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-int 3780  df-iun 3823  df-br 3938  df-opab 3998  df-mpt 3999  df-tr 4035  df-id 4223  df-po 4226  df-iso 4227  df-iord 4296  df-on 4298  df-ilim 4299  df-suc 4301  df-iom 4513  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-f1 5136  df-fo 5137  df-f1o 5138  df-fv 5139  df-riota 5738  df-ov 5785  df-oprab 5786  df-mpo 5787  df-1st 6046  df-2nd 6047  df-recs 6210  df-frec 6296  df-1o 6321  df-2o 6322  df-er 6437  df-en 6643  df-sup 6879  df-pnf 7826  df-mnf 7827  df-xr 7828  df-ltxr 7829  df-le 7830  df-sub 7959  df-neg 7960  df-reap 8361  df-ap 8368  df-div 8457  df-inn 8745  df-2 8803  df-3 8804  df-4 8805  df-n0 9002  df-z 9079  df-uz 9351  df-q 9439  df-rp 9471  df-fz 9822  df-fzo 9951  df-fl 10074  df-mod 10127  df-seqfrec 10250  df-exp 10324  df-cj 10646  df-re 10647  df-im 10648  df-rsqrt 10802  df-abs 10803  df-dvds 11530  df-gcd 11672  df-prm 11825
This theorem is referenced by:  prmrp  11859  euclemma  11860  cncongrprm  11871  isoddgcd1  11873  phiprmpw  11934
  Copyright terms: Public domain W3C validator