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

Theorem coprmdvds 12687
Description: Euclid's Lemma (see ProofWiki "Euclid's Lemma", 10-Jul-2021, https://proofwiki.org/wiki/Euclid's_Lemma): If an integer divides the product of two integers and is coprime to one of them, then it divides the other. See also theorem 1.5 in [ApostolNT] p. 16. (Contributed by Paul Chapman, 22-Jun-2011.) (Proof shortened by AV, 10-Jul-2021.)
Assertion
Ref Expression
coprmdvds  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  (
( K  ||  ( M  x.  N )  /\  ( K  gcd  M
)  =  1 )  ->  K  ||  N
) )

Proof of Theorem coprmdvds
StepHypRef Expression
1 zcn 9489 . . . . . . . . . . 11  |-  ( M  e.  ZZ  ->  M  e.  CC )
2 zcn 9489 . . . . . . . . . . 11  |-  ( N  e.  ZZ  ->  N  e.  CC )
3 mulcom 8166 . . . . . . . . . . 11  |-  ( ( M  e.  CC  /\  N  e.  CC )  ->  ( M  x.  N
)  =  ( N  x.  M ) )
41, 2, 3syl2an 289 . . . . . . . . . 10  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  x.  N
)  =  ( N  x.  M ) )
54breq2d 4101 . . . . . . . . 9  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  ||  ( M  x.  N )  <->  K 
||  ( N  x.  M ) ) )
6 dvdsmulgcd 12619 . . . . . . . . . 10  |-  ( ( N  e.  ZZ  /\  M  e.  ZZ )  ->  ( K  ||  ( N  x.  M )  <->  K 
||  ( N  x.  ( M  gcd  K ) ) ) )
76ancoms 268 . . . . . . . . 9  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  ||  ( N  x.  M )  <->  K 
||  ( N  x.  ( M  gcd  K ) ) ) )
85, 7bitrd 188 . . . . . . . 8  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  ||  ( M  x.  N )  <->  K 
||  ( N  x.  ( M  gcd  K ) ) ) )
983adant1 1041 . . . . . . 7  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  ||  ( M  x.  N )  <->  K  ||  ( N  x.  ( M  gcd  K ) ) ) )
109adantr 276 . . . . . 6  |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  gcd  M
)  =  1 )  ->  ( K  ||  ( M  x.  N
)  <->  K  ||  ( N  x.  ( M  gcd  K ) ) ) )
11 gcdcom 12567 . . . . . . . . . . . 12  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ )  ->  ( K  gcd  M
)  =  ( M  gcd  K ) )
12113adant3 1043 . . . . . . . . . . 11  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  gcd  M )  =  ( M  gcd  K
) )
1312eqeq1d 2239 . . . . . . . . . 10  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  (
( K  gcd  M
)  =  1  <->  ( M  gcd  K )  =  1 ) )
14 oveq2 6031 . . . . . . . . . 10  |-  ( ( M  gcd  K )  =  1  ->  ( N  x.  ( M  gcd  K ) )  =  ( N  x.  1 ) )
1513, 14biimtrdi 163 . . . . . . . . 9  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  (
( K  gcd  M
)  =  1  -> 
( N  x.  ( M  gcd  K ) )  =  ( N  x.  1 ) ) )
1615imp 124 . . . . . . . 8  |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  gcd  M
)  =  1 )  ->  ( N  x.  ( M  gcd  K ) )  =  ( N  x.  1 ) )
172mulridd 8201 . . . . . . . . . 10  |-  ( N  e.  ZZ  ->  ( N  x.  1 )  =  N )
18173ad2ant3 1046 . . . . . . . . 9  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  ( N  x.  1 )  =  N )
1918adantr 276 . . . . . . . 8  |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  gcd  M
)  =  1 )  ->  ( N  x.  1 )  =  N )
2016, 19eqtrd 2263 . . . . . . 7  |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  gcd  M
)  =  1 )  ->  ( N  x.  ( M  gcd  K ) )  =  N )
2120breq2d 4101 . . . . . 6  |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  gcd  M
)  =  1 )  ->  ( K  ||  ( N  x.  ( M  gcd  K ) )  <-> 
K  ||  N )
)
2210, 21bitrd 188 . . . . 5  |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  gcd  M
)  =  1 )  ->  ( K  ||  ( M  x.  N
)  <->  K  ||  N ) )
2322biimpd 144 . . . 4  |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  gcd  M
)  =  1 )  ->  ( K  ||  ( M  x.  N
)  ->  K  ||  N
) )
2423ex 115 . . 3  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  (
( K  gcd  M
)  =  1  -> 
( K  ||  ( M  x.  N )  ->  K  ||  N ) ) )
2524com23 78 . 2  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  ||  ( M  x.  N )  ->  (
( K  gcd  M
)  =  1  ->  K  ||  N ) ) )
2625impd 254 1  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  (
( K  ||  ( M  x.  N )  /\  ( K  gcd  M
)  =  1 )  ->  K  ||  N
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1004    = wceq 1397    e. wcel 2201   class class class wbr 4089  (class class class)co 6023   CCcc 8035   1c1 8038    x. cmul 8042   ZZcz 9484    || cdvds 12371    gcd cgcd 12547
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2203  ax-14 2204  ax-ext 2212  ax-coll 4205  ax-sep 4208  ax-nul 4216  ax-pow 4266  ax-pr 4301  ax-un 4532  ax-setind 4637  ax-iinf 4688  ax-cnex 8128  ax-resscn 8129  ax-1cn 8130  ax-1re 8131  ax-icn 8132  ax-addcl 8133  ax-addrcl 8134  ax-mulcl 8135  ax-mulrcl 8136  ax-addcom 8137  ax-mulcom 8138  ax-addass 8139  ax-mulass 8140  ax-distr 8141  ax-i2m1 8142  ax-0lt1 8143  ax-1rid 8144  ax-0id 8145  ax-rnegex 8146  ax-precex 8147  ax-cnre 8148  ax-pre-ltirr 8149  ax-pre-ltwlin 8150  ax-pre-lttrn 8151  ax-pre-apti 8152  ax-pre-ltadd 8153  ax-pre-mulgt0 8154  ax-pre-mulext 8155  ax-arch 8156  ax-caucvg 8157
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-nel 2497  df-ral 2514  df-rex 2515  df-reu 2516  df-rmo 2517  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-nul 3494  df-if 3605  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-int 3930  df-iun 3973  df-br 4090  df-opab 4152  df-mpt 4153  df-tr 4189  df-id 4392  df-po 4395  df-iso 4396  df-iord 4465  df-on 4467  df-ilim 4468  df-suc 4470  df-iom 4691  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-ima 4740  df-iota 5288  df-fun 5330  df-fn 5331  df-f 5332  df-f1 5333  df-fo 5334  df-f1o 5335  df-fv 5336  df-riota 5976  df-ov 6026  df-oprab 6027  df-mpo 6028  df-1st 6308  df-2nd 6309  df-recs 6476  df-frec 6562  df-sup 7188  df-pnf 8221  df-mnf 8222  df-xr 8223  df-ltxr 8224  df-le 8225  df-sub 8357  df-neg 8358  df-reap 8760  df-ap 8767  df-div 8858  df-inn 9149  df-2 9207  df-3 9208  df-4 9209  df-n0 9408  df-z 9485  df-uz 9761  df-q 9859  df-rp 9894  df-fz 10249  df-fzo 10383  df-fl 10536  df-mod 10591  df-seqfrec 10716  df-exp 10807  df-cj 11425  df-re 11426  df-im 11427  df-rsqrt 11581  df-abs 11582  df-dvds 12372  df-gcd 12548
This theorem is referenced by:  coprmdvds2  12688  qredeq  12691  cncongr1  12698  euclemma  12741  eulerthlemh  12826  eulerthlemth  12827  prmdiveq  12831  prmpwdvds  12951  mpodvdsmulf1o  15743  perfectlem1  15752  lgseisenlem1  15828  lgseisenlem2  15829  lgsquadlem2  15836  lgsquadlem3  15837  2sqlem8  15881
  Copyright terms: Public domain W3C validator