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

Theorem coprm 10989
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 10959 . . . . . . 7  |-  ( P  e.  Prime  ->  P  e.  ZZ )
2 gcddvds 10821 . . . . . . 7  |-  ( ( P  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( P  gcd  N )  ||  P  /\  ( P  gcd  N ) 
||  N ) )
31, 2sylan 277 . . . . . 6  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  (
( P  gcd  N
)  ||  P  /\  ( P  gcd  N ) 
||  N ) )
43simprd 112 . . . . 5  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( P  gcd  N )  ||  N )
5 breq1 3822 . . . . 5  |-  ( ( P  gcd  N )  =  P  ->  (
( P  gcd  N
)  ||  N  <->  P  ||  N
) )
64, 5syl5ibcom 153 . . . 4  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  (
( P  gcd  N
)  =  P  ->  P  ||  N ) )
76con3d 594 . . 3  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( -.  P  ||  N  ->  -.  ( P  gcd  N
)  =  P ) )
8 0nnn 8376 . . . . . . . . 9  |-  -.  0  e.  NN
9 prmnn 10958 . . . . . . . . . 10  |-  ( P  e.  Prime  ->  P  e.  NN )
10 eleq1 2147 . . . . . . . . . 10  |-  ( P  =  0  ->  ( P  e.  NN  <->  0  e.  NN ) )
119, 10syl5ibcom 153 . . . . . . . . 9  |-  ( P  e.  Prime  ->  ( P  =  0  ->  0  e.  NN ) )
128, 11mtoi 623 . . . . . . . 8  |-  ( P  e.  Prime  ->  -.  P  =  0 )
1312intnanrd 877 . . . . . . 7  |-  ( P  e.  Prime  ->  -.  ( P  =  0  /\  N  =  0 ) )
1413adantr 270 . . . . . 6  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  -.  ( P  =  0  /\  N  =  0
) )
15 gcdn0cl 10820 . . . . . . . 8  |-  ( ( ( P  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( P  =  0  /\  N  =  0 ) )  ->  ( P  gcd  N )  e.  NN )
1615ex 113 . . . . . . 7  |-  ( ( P  e.  ZZ  /\  N  e.  ZZ )  ->  ( -.  ( P  =  0  /\  N  =  0 )  -> 
( P  gcd  N
)  e.  NN ) )
171, 16sylan 277 . . . . . 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 110 . . . . 5  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( P  gcd  N )  ||  P )
20 isprm2 10965 . . . . . . . 8  |-  ( P  e.  Prime  <->  ( P  e.  ( ZZ>= `  2 )  /\  A. z  e.  NN  ( z  ||  P  ->  ( z  =  1  \/  z  =  P ) ) ) )
2120simprbi 269 . . . . . . 7  |-  ( P  e.  Prime  ->  A. z  e.  NN  ( z  ||  P  ->  ( z  =  1  \/  z  =  P ) ) )
22 breq1 3822 . . . . . . . . 9  |-  ( z  =  ( P  gcd  N )  ->  ( z  ||  P  <->  ( P  gcd  N )  ||  P ) )
23 eqeq1 2091 . . . . . . . . . 10  |-  ( z  =  ( P  gcd  N )  ->  ( z  =  1  <->  ( P  gcd  N )  =  1 ) )
24 eqeq1 2091 . . . . . . . . . 10  |-  ( z  =  ( P  gcd  N )  ->  ( z  =  P  <->  ( P  gcd  N )  =  P ) )
2523, 24orbi12d 740 . . . . . . . . 9  |-  ( z  =  ( P  gcd  N )  ->  ( (
z  =  1  \/  z  =  P )  <-> 
( ( P  gcd  N )  =  1  \/  ( P  gcd  N
)  =  P ) ) )
2622, 25imbi12d 232 . . . . . . . 8  |-  ( z  =  ( P  gcd  N )  ->  ( (
z  ||  P  ->  ( z  =  1  \/  z  =  P ) )  <->  ( ( P  gcd  N )  ||  P  ->  ( ( P  gcd  N )  =  1  \/  ( P  gcd  N )  =  P ) ) ) )
2726rspcv 2711 . . . . . . 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 270 . . . . 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 46 . . . 4  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  (
( P  gcd  N
)  =  1  \/  ( P  gcd  N
)  =  P ) )
31 biorf 696 . . . . 5  |-  ( -.  ( P  gcd  N
)  =  P  -> 
( ( P  gcd  N )  =  1  <->  (
( P  gcd  N
)  =  P  \/  ( P  gcd  N )  =  1 ) ) )
32 orcom 680 . . . . 5  |-  ( ( ( P  gcd  N
)  =  P  \/  ( P  gcd  N )  =  1 )  <->  ( ( P  gcd  N )  =  1  \/  ( P  gcd  N )  =  P ) )
3331, 32syl6bb 194 . . . 4  |-  ( -.  ( P  gcd  N
)  =  P  -> 
( ( P  gcd  N )  =  1  <->  (
( P  gcd  N
)  =  1  \/  ( P  gcd  N
)  =  P ) ) )
3430, 33syl5ibrcom 155 . . 3  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( -.  ( P  gcd  N
)  =  P  -> 
( P  gcd  N
)  =  1 ) )
357, 34syld 44 . 2  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( -.  P  ||  N  -> 
( P  gcd  N
)  =  1 ) )
36 iddvds 10675 . . . . . . 7  |-  ( P  e.  ZZ  ->  P  ||  P )
371, 36syl 14 . . . . . 6  |-  ( P  e.  Prime  ->  P  ||  P )
3837adantr 270 . . . . 5  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  P  ||  P )
39 dvdslegcd 10822 . . . . . . . . 9  |-  ( ( ( P  e.  ZZ  /\  P  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( P  =  0  /\  N  =  0 ) )  -> 
( ( P  ||  P  /\  P  ||  N
)  ->  P  <_  ( P  gcd  N ) ) )
4039ex 113 . . . . . . . 8  |-  ( ( P  e.  ZZ  /\  P  e.  ZZ  /\  N  e.  ZZ )  ->  ( -.  ( P  =  0  /\  N  =  0 )  ->  ( ( P  ||  P  /\  P  ||  N )  ->  P  <_  ( P  gcd  N
) ) ) )
41403anidm12 1229 . . . . . . 7  |-  ( ( P  e.  ZZ  /\  N  e.  ZZ )  ->  ( -.  ( P  =  0  /\  N  =  0 )  -> 
( ( P  ||  P  /\  P  ||  N
)  ->  P  <_  ( P  gcd  N ) ) ) )
421, 41sylan 277 . . . . . 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 420 . . . 4  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( P  ||  N  ->  P  <_  ( P  gcd  N
) ) )
45 prmgt1 10979 . . . . . 6  |-  ( P  e.  Prime  ->  1  < 
P )
4645adantr 270 . . . . 5  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  1  <  P )
471zred 8793 . . . . . . 7  |-  ( P  e.  Prime  ->  P  e.  RR )
4847adantr 270 . . . . . 6  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  P  e.  RR )
4918nnred 8362 . . . . . 6  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( P  gcd  N )  e.  RR )
50 1re 7423 . . . . . . 7  |-  1  e.  RR
51 ltletr 7510 . . . . . . 7  |-  ( ( 1  e.  RR  /\  P  e.  RR  /\  ( P  gcd  N )  e.  RR )  ->  (
( 1  <  P  /\  P  <_  ( P  gcd  N ) )  ->  1  <  ( P  gcd  N ) ) )
5250, 51mp3an1 1258 . . . . . 6  |-  ( ( P  e.  RR  /\  ( P  gcd  N )  e.  RR )  -> 
( ( 1  < 
P  /\  P  <_  ( P  gcd  N ) )  ->  1  <  ( P  gcd  N ) ) )
5348, 49, 52syl2anc 403 . . . . 5  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  (
( 1  <  P  /\  P  <_  ( P  gcd  N ) )  ->  1  <  ( P  gcd  N ) ) )
5446, 53mpand 420 . . . 4  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( P  <_  ( P  gcd  N )  ->  1  <  ( P  gcd  N ) ) )
55 ltne 7506 . . . . . 6  |-  ( ( 1  e.  RR  /\  1  <  ( P  gcd  N ) )  ->  ( P  gcd  N )  =/=  1 )
5650, 55mpan 415 . . . . 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 56 . . 3  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  ( P  ||  N  ->  ( P  gcd  N )  =/=  1 ) )
5958necon2bd 2309 . 2  |-  ( ( P  e.  Prime  /\  N  e.  ZZ )  ->  (
( P  gcd  N
)  =  1  ->  -.  P  ||  N ) )
6035, 59impbid 127 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 102    <-> wb 103    \/ wo 662    /\ w3a 922    = wceq 1287    e. wcel 1436    =/= wne 2251   A.wral 2355   class class class wbr 3819   ` cfv 4977  (class class class)co 5606   RRcr 7285   0cc0 7286   1c1 7287    < clt 7458    <_ cle 7459   NNcn 8349   2c2 8399   ZZcz 8675   ZZ>=cuz 8943    || cdvds 10662    gcd cgcd 10804   Primecprime 10955
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1379  ax-7 1380  ax-gen 1381  ax-ie1 1425  ax-ie2 1426  ax-8 1438  ax-10 1439  ax-11 1440  ax-i12 1441  ax-bndl 1442  ax-4 1443  ax-13 1447  ax-14 1448  ax-17 1462  ax-i9 1466  ax-ial 1470  ax-i5r 1471  ax-ext 2067  ax-coll 3927  ax-sep 3930  ax-nul 3938  ax-pow 3982  ax-pr 4008  ax-un 4232  ax-setind 4324  ax-iinf 4374  ax-cnex 7372  ax-resscn 7373  ax-1cn 7374  ax-1re 7375  ax-icn 7376  ax-addcl 7377  ax-addrcl 7378  ax-mulcl 7379  ax-mulrcl 7380  ax-addcom 7381  ax-mulcom 7382  ax-addass 7383  ax-mulass 7384  ax-distr 7385  ax-i2m1 7386  ax-0lt1 7387  ax-1rid 7388  ax-0id 7389  ax-rnegex 7390  ax-precex 7391  ax-cnre 7392  ax-pre-ltirr 7393  ax-pre-ltwlin 7394  ax-pre-lttrn 7395  ax-pre-apti 7396  ax-pre-ltadd 7397  ax-pre-mulgt0 7398  ax-pre-mulext 7399  ax-arch 7400  ax-caucvg 7401
This theorem depends on definitions:  df-bi 115  df-dc 779  df-3or 923  df-3an 924  df-tru 1290  df-fal 1293  df-nf 1393  df-sb 1690  df-eu 1948  df-mo 1949  df-clab 2072  df-cleq 2078  df-clel 2081  df-nfc 2214  df-ne 2252  df-nel 2347  df-ral 2360  df-rex 2361  df-reu 2362  df-rmo 2363  df-rab 2364  df-v 2617  df-sbc 2830  df-csb 2923  df-dif 2990  df-un 2992  df-in 2994  df-ss 3001  df-nul 3276  df-if 3380  df-pw 3416  df-sn 3436  df-pr 3437  df-op 3439  df-uni 3636  df-int 3671  df-iun 3714  df-br 3820  df-opab 3874  df-mpt 3875  df-tr 3910  df-id 4092  df-po 4095  df-iso 4096  df-iord 4165  df-on 4167  df-ilim 4168  df-suc 4170  df-iom 4377  df-xp 4415  df-rel 4416  df-cnv 4417  df-co 4418  df-dm 4419  df-rn 4420  df-res 4421  df-ima 4422  df-iota 4942  df-fun 4979  df-fn 4980  df-f 4981  df-f1 4982  df-fo 4983  df-f1o 4984  df-fv 4985  df-riota 5562  df-ov 5609  df-oprab 5610  df-mpt2 5611  df-1st 5861  df-2nd 5862  df-recs 6017  df-frec 6103  df-1o 6128  df-2o 6129  df-er 6237  df-en 6403  df-sup 6615  df-pnf 7460  df-mnf 7461  df-xr 7462  df-ltxr 7463  df-le 7464  df-sub 7591  df-neg 7592  df-reap 7985  df-ap 7992  df-div 8071  df-inn 8350  df-2 8408  df-3 8409  df-4 8410  df-n0 8599  df-z 8676  df-uz 8944  df-q 9029  df-rp 9059  df-fz 9349  df-fzo 9474  df-fl 9597  df-mod 9650  df-iseq 9772  df-iexp 9845  df-cj 10163  df-re 10164  df-im 10165  df-rsqrt 10318  df-abs 10319  df-dvds 10663  df-gcd 10805  df-prm 10956
This theorem is referenced by:  prmrp  10990  euclemma  10991  cncongrprm  11002  isoddgcd1  11004  phiprmpw  11064
  Copyright terms: Public domain W3C validator