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

Theorem dvdsgcd 12815
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 12814 . . 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 12617 . . . . . . . . 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 9661 . . . . . . . . . 10  |-  ( x  e.  ZZ  ->  x  e.  CC )
9 zcn 9661 . . . . . . . . . 10  |-  ( M  e.  ZZ  ->  M  e.  CC )
10 mulcom 8315 . . . . . . . . . 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 9661 . . . . . . . . . 10  |-  ( y  e.  ZZ  ->  y  e.  CC )
16 zcn 9661 . . . . . . . . . 10  |-  ( N  e.  ZZ  ->  N  e.  CC )
17 mulcom 8315 . . . . . . . . . 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 6106 . . . . . . 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 4157 . . . . . 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 4135 . . . . . 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 4131  (class class class)co 6088   CCcc 8184    + caddc 8189    x. cmul 8191   ZZcz 9656    || cdvds 12580    gcd cgcd 12756
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 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8277  ax-resscn 8278  ax-1cn 8279  ax-1re 8280  ax-icn 8281  ax-addcl 8282  ax-addrcl 8283  ax-mulcl 8284  ax-mulrcl 8285  ax-addcom 8286  ax-mulcom 8287  ax-addass 8288  ax-mulass 8289  ax-distr 8290  ax-i2m1 8291  ax-0lt1 8292  ax-1rid 8293  ax-0id 8294  ax-rnegex 8295  ax-precex 8296  ax-cnre 8297  ax-pre-ltirr 8298  ax-pre-ltwlin 8299  ax-pre-lttrn 8300  ax-pre-apti 8301  ax-pre-ltadd 8302  ax-pre-mulgt0 8303  ax-pre-mulext 8304  ax-arch 8305  ax-caucvg 8306
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 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-frec 6666  df-sup 7331  df-pnf 8369  df-mnf 8370  df-xr 8371  df-ltxr 8372  df-le 8373  df-sub 8507  df-neg 8508  df-reap 8912  df-ap 8919  df-div 9012  df-inn 9315  df-2 9373  df-3 9374  df-4 9375  df-n0 9576  df-z 9657  df-uz 9939  df-q 10037  df-rp 10073  df-fz 10430  df-fzo 10568  df-fl 10723  df-mod 10782  df-seqfrec 10907  df-exp 10998  df-cj 11630  df-re 11631  df-im 11632  df-rsqrt 11787  df-abs 11788  df-dvds 12581  df-gcd 12757
This theorem is used by:  dvdsgcdb  12816  dfgcd2  12817  mulgcd  12819  ncoprmgcdne1b  12893  mulgcddvds  12898  rpmulgcd2  12899  rpexp  12958  pythagtriplem4  13077  pcgcd1  13137  pockthlem  13165  lgsne0  16374  lgsquad2lem2  16418
  Copyright terms: Public domain W3C validator