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

Theorem dvdsgcd 12807
Description: An integer which divides each of two others also divides their gcd. (Contributed by Paul Chapman, 22-Jun-2011.) (Revised by Mario Carneiro, 30-May-2014.)
Assertion
Ref Expression
dvdsgcd  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  (
( K  ||  M  /\  K  ||  N )  ->  K  ||  ( M  gcd  N ) ) )

Proof of Theorem dvdsgcd
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 bezout 12806 . . 3  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  E. x  e.  ZZ  E. y  e.  ZZ  ( M  gcd  N )  =  ( ( M  x.  x )  +  ( N  x.  y ) ) )
213adant1 1046 . 2  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  E. x  e.  ZZ  E. y  e.  ZZ  ( M  gcd  N )  =  ( ( M  x.  x )  +  ( N  x.  y ) ) )
3 dvds2ln 12609 . . . . . . . . 9  |-  ( ( ( x  e.  ZZ  /\  y  e.  ZZ )  /\  ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ ) )  -> 
( ( K  ||  M  /\  K  ||  N
)  ->  K  ||  (
( x  x.  M
)  +  ( y  x.  N ) ) ) )
433impia 1231 . . . . . . . 8  |-  ( ( ( x  e.  ZZ  /\  y  e.  ZZ )  /\  ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  ||  M  /\  K  ||  N ) )  ->  K  ||  ( ( x  x.  M )  +  ( y  x.  N
) ) )
543coml 1241 . . . . . . 7  |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  ||  M  /\  K  ||  N )  /\  ( x  e.  ZZ  /\  y  e.  ZZ ) )  ->  K  ||  ( ( x  x.  M )  +  ( y  x.  N
) ) )
6 simp3l 1056 . . . . . . . . 9  |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  ||  M  /\  K  ||  N )  /\  ( x  e.  ZZ  /\  y  e.  ZZ ) )  ->  x  e.  ZZ )
7 simp12 1059 . . . . . . . . 9  |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  ||  M  /\  K  ||  N )  /\  ( x  e.  ZZ  /\  y  e.  ZZ ) )  ->  M  e.  ZZ )
8 zcn 9654 . . . . . . . . . 10  |-  ( x  e.  ZZ  ->  x  e.  CC )
9 zcn 9654 . . . . . . . . . 10  |-  ( M  e.  ZZ  ->  M  e.  CC )
10 mulcom 8309 . . . . . . . . . 10  |-  ( ( x  e.  CC  /\  M  e.  CC )  ->  ( x  x.  M
)  =  ( M  x.  x ) )
118, 9, 10syl2an 289 . . . . . . . . 9  |-  ( ( x  e.  ZZ  /\  M  e.  ZZ )  ->  ( x  x.  M
)  =  ( M  x.  x ) )
126, 7, 11syl2anc 415 . . . . . . . 8  |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  ||  M  /\  K  ||  N )  /\  ( x  e.  ZZ  /\  y  e.  ZZ ) )  -> 
( x  x.  M
)  =  ( M  x.  x ) )
13 simp3r 1057 . . . . . . . . 9  |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  ||  M  /\  K  ||  N )  /\  ( x  e.  ZZ  /\  y  e.  ZZ ) )  -> 
y  e.  ZZ )
14 simp13 1060 . . . . . . . . 9  |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  ||  M  /\  K  ||  N )  /\  ( x  e.  ZZ  /\  y  e.  ZZ ) )  ->  N  e.  ZZ )
15 zcn 9654 . . . . . . . . . 10  |-  ( y  e.  ZZ  ->  y  e.  CC )
16 zcn 9654 . . . . . . . . . 10  |-  ( N  e.  ZZ  ->  N  e.  CC )
17 mulcom 8309 . . . . . . . . . 10  |-  ( ( y  e.  CC  /\  N  e.  CC )  ->  ( y  x.  N
)  =  ( N  x.  y ) )
1815, 16, 17syl2an 289 . . . . . . . . 9  |-  ( ( y  e.  ZZ  /\  N  e.  ZZ )  ->  ( y  x.  N
)  =  ( N  x.  y ) )
1913, 14, 18syl2anc 415 . . . . . . . 8  |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  ||  M  /\  K  ||  N )  /\  ( x  e.  ZZ  /\  y  e.  ZZ ) )  -> 
( y  x.  N
)  =  ( N  x.  y ) )
2012, 19oveq12d 6103 . . . . . . 7  |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  ||  M  /\  K  ||  N )  /\  ( x  e.  ZZ  /\  y  e.  ZZ ) )  -> 
( ( x  x.  M )  +  ( y  x.  N ) )  =  ( ( M  x.  x )  +  ( N  x.  y ) ) )
215, 20breqtrd 4156 . . . . . 6  |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  ||  M  /\  K  ||  N )  /\  ( x  e.  ZZ  /\  y  e.  ZZ ) )  ->  K  ||  ( ( M  x.  x )  +  ( N  x.  y
) ) )
22 breq2 4134 . . . . . 6  |-  ( ( M  gcd  N )  =  ( ( M  x.  x )  +  ( N  x.  y
) )  ->  ( K  ||  ( M  gcd  N )  <->  K  ||  ( ( M  x.  x )  +  ( N  x.  y ) ) ) )
2321, 22syl5ibrcom 157 . . . . 5  |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  ||  M  /\  K  ||  N )  /\  ( x  e.  ZZ  /\  y  e.  ZZ ) )  -> 
( ( M  gcd  N )  =  ( ( M  x.  x )  +  ( N  x.  y ) )  ->  K  ||  ( M  gcd  N ) ) )
24233expia 1236 . . . 4  |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  ||  M  /\  K  ||  N ) )  ->  ( (
x  e.  ZZ  /\  y  e.  ZZ )  ->  ( ( M  gcd  N )  =  ( ( M  x.  x )  +  ( N  x.  y ) )  ->  K  ||  ( M  gcd  N ) ) ) )
2524rexlimdvv 2675 . . 3  |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  ||  M  /\  K  ||  N ) )  ->  ( E. x  e.  ZZ  E. y  e.  ZZ  ( M  gcd  N )  =  ( ( M  x.  x )  +  ( N  x.  y ) )  ->  K  ||  ( M  gcd  N ) ) )
2625ex 115 . 2  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  (
( K  ||  M  /\  K  ||  N )  ->  ( E. x  e.  ZZ  E. y  e.  ZZ  ( M  gcd  N )  =  ( ( M  x.  x )  +  ( N  x.  y ) )  ->  K  ||  ( M  gcd  N ) ) ) )
272, 26mpid 42 1  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  (
( K  ||  M  /\  K  ||  N )  ->  K  ||  ( M  gcd  N ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    /\ w3a 1009    = wceq 1402    e. wcel 2209   E.wrex 2529   class class class wbr 4130  (class class class)co 6085   CCcc 8178    + caddc 8183    x. cmul 8185   ZZcz 9649    || cdvds 12572    gcd cgcd 12748
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-mulrcl 8279  ax-addcom 8280  ax-mulcom 8281  ax-addass 8282  ax-mulass 8283  ax-distr 8284  ax-i2m1 8285  ax-0lt1 8286  ax-1rid 8287  ax-0id 8288  ax-rnegex 8289  ax-precex 8290  ax-cnre 8291  ax-pre-ltirr 8292  ax-pre-ltwlin 8293  ax-pre-lttrn 8294  ax-pre-apti 8295  ax-pre-ltadd 8296  ax-pre-mulgt0 8297  ax-pre-mulext 8298  ax-arch 8299  ax-caucvg 8300
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-sup 7325  df-pnf 8363  df-mnf 8364  df-xr 8365  df-ltxr 8366  df-le 8367  df-sub 8501  df-neg 8502  df-reap 8906  df-ap 8913  df-div 9006  df-inn 9308  df-2 9366  df-3 9367  df-4 9368  df-n0 9569  df-z 9650  df-uz 9932  df-q 10030  df-rp 10066  df-fz 10423  df-fzo 10561  df-fl 10716  df-mod 10774  df-seqfrec 10899  df-exp 10990  df-cj 11622  df-re 11623  df-im 11624  df-rsqrt 11779  df-abs 11780  df-dvds 12573  df-gcd 12749
This theorem is used by:  dvdsgcdb  12808  dfgcd2  12809  mulgcd  12811  ncoprmgcdne1b  12885  mulgcddvds  12890  rpmulgcd2  12891  rpexp  12950  pythagtriplem4  13069  pcgcd1  13129  pockthlem  13157  lgsne0  16279  lgsquad2lem2  16323
  Copyright terms: Public domain W3C validator