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

Theorem absmulgcd 12819
Description: Distribute absolute value of multiplication over gcd. Theorem 1.4(c) in [ApostolNT] p. 16. (Contributed by Paul Chapman, 22-Jun-2011.)
Assertion
Ref Expression
absmulgcd  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  (
( K  x.  M
)  gcd  ( K  x.  N ) )  =  ( abs `  ( K  x.  ( M  gcd  N ) ) ) )

Proof of Theorem absmulgcd
StepHypRef Expression
1 gcdcl 12768 . . . . 5  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  gcd  N
)  e.  NN0 )
2 nn0re 9583 . . . . . 6  |-  ( ( M  gcd  N )  e.  NN0  ->  ( M  gcd  N )  e.  RR )
3 nn0ge0 9599 . . . . . 6  |-  ( ( M  gcd  N )  e.  NN0  ->  0  <_ 
( M  gcd  N
) )
42, 3absidd 11956 . . . . 5  |-  ( ( M  gcd  N )  e.  NN0  ->  ( abs `  ( M  gcd  N
) )  =  ( M  gcd  N ) )
51, 4syl 14 . . . 4  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( abs `  ( M  gcd  N ) )  =  ( M  gcd  N ) )
65oveq2d 6104 . . 3  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( abs `  K
)  x.  ( abs `  ( M  gcd  N
) ) )  =  ( ( abs `  K
)  x.  ( M  gcd  N ) ) )
763adant1 1046 . 2  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  (
( abs `  K
)  x.  ( abs `  ( M  gcd  N
) ) )  =  ( ( abs `  K
)  x.  ( M  gcd  N ) ) )
8 zcn 9660 . . . 4  |-  ( K  e.  ZZ  ->  K  e.  CC )
91nn0cnd 9633 . . . 4  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  gcd  N
)  e.  CC )
10 absmul 11857 . . . 4  |-  ( ( K  e.  CC  /\  ( M  gcd  N )  e.  CC )  -> 
( abs `  ( K  x.  ( M  gcd  N ) ) )  =  ( ( abs `  K )  x.  ( abs `  ( M  gcd  N ) ) ) )
118, 9, 10syl2an 289 . . 3  |-  ( ( K  e.  ZZ  /\  ( M  e.  ZZ  /\  N  e.  ZZ ) )  ->  ( abs `  ( K  x.  ( M  gcd  N ) ) )  =  ( ( abs `  K )  x.  ( abs `  ( M  gcd  N ) ) ) )
12113impb 1230 . 2  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  ( abs `  ( K  x.  ( M  gcd  N ) ) )  =  ( ( abs `  K
)  x.  ( abs `  ( M  gcd  N
) ) ) )
13 zcn 9660 . . . . 5  |-  ( M  e.  ZZ  ->  M  e.  CC )
14 zcn 9660 . . . . 5  |-  ( N  e.  ZZ  ->  N  e.  CC )
15 absmul 11857 . . . . . . 7  |-  ( ( K  e.  CC  /\  M  e.  CC )  ->  ( abs `  ( K  x.  M )
)  =  ( ( abs `  K )  x.  ( abs `  M
) ) )
16 absmul 11857 . . . . . . 7  |-  ( ( K  e.  CC  /\  N  e.  CC )  ->  ( abs `  ( K  x.  N )
)  =  ( ( abs `  K )  x.  ( abs `  N
) ) )
1715, 16oveqan12d 6107 . . . . . 6  |-  ( ( ( K  e.  CC  /\  M  e.  CC )  /\  ( K  e.  CC  /\  N  e.  CC ) )  -> 
( ( abs `  ( K  x.  M )
)  gcd  ( abs `  ( K  x.  N
) ) )  =  ( ( ( abs `  K )  x.  ( abs `  M ) )  gcd  ( ( abs `  K )  x.  ( abs `  N ) ) ) )
18173impdi 1334 . . . . 5  |-  ( ( K  e.  CC  /\  M  e.  CC  /\  N  e.  CC )  ->  (
( abs `  ( K  x.  M )
)  gcd  ( abs `  ( K  x.  N
) ) )  =  ( ( ( abs `  K )  x.  ( abs `  M ) )  gcd  ( ( abs `  K )  x.  ( abs `  N ) ) ) )
198, 13, 14, 18syl3an 1320 . . . 4  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  (
( abs `  ( K  x.  M )
)  gcd  ( abs `  ( K  x.  N
) ) )  =  ( ( ( abs `  K )  x.  ( abs `  M ) )  gcd  ( ( abs `  K )  x.  ( abs `  N ) ) ) )
20 zmulcl 9709 . . . . . 6  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ )  ->  ( K  x.  M
)  e.  ZZ )
21 zmulcl 9709 . . . . . 6  |-  ( ( K  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  x.  N
)  e.  ZZ )
22 gcdabs 12790 . . . . . 6  |-  ( ( ( K  x.  M
)  e.  ZZ  /\  ( K  x.  N
)  e.  ZZ )  ->  ( ( abs `  ( K  x.  M
) )  gcd  ( abs `  ( K  x.  N ) ) )  =  ( ( K  x.  M )  gcd  ( K  x.  N
) ) )
2320, 21, 22syl2an 289 . . . . 5  |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ )  /\  ( K  e.  ZZ  /\  N  e.  ZZ ) )  -> 
( ( abs `  ( K  x.  M )
)  gcd  ( abs `  ( K  x.  N
) ) )  =  ( ( K  x.  M )  gcd  ( K  x.  N )
) )
24233impdi 1334 . . . 4  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  (
( abs `  ( K  x.  M )
)  gcd  ( abs `  ( K  x.  N
) ) )  =  ( ( K  x.  M )  gcd  ( K  x.  N )
) )
25 nn0abscl 11874 . . . . 5  |-  ( K  e.  ZZ  ->  ( abs `  K )  e. 
NN0 )
26 zabscl 11875 . . . . 5  |-  ( M  e.  ZZ  ->  ( abs `  M )  e.  ZZ )
27 zabscl 11875 . . . . 5  |-  ( N  e.  ZZ  ->  ( abs `  N )  e.  ZZ )
28 mulgcd 12818 . . . . 5  |-  ( ( ( abs `  K
)  e.  NN0  /\  ( abs `  M )  e.  ZZ  /\  ( abs `  N )  e.  ZZ )  ->  (
( ( abs `  K
)  x.  ( abs `  M ) )  gcd  ( ( abs `  K
)  x.  ( abs `  N ) ) )  =  ( ( abs `  K )  x.  (
( abs `  M
)  gcd  ( abs `  N ) ) ) )
2925, 26, 27, 28syl3an 1320 . . . 4  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  (
( ( abs `  K
)  x.  ( abs `  M ) )  gcd  ( ( abs `  K
)  x.  ( abs `  N ) ) )  =  ( ( abs `  K )  x.  (
( abs `  M
)  gcd  ( abs `  N ) ) ) )
3019, 24, 293eqtr3d 2279 . . 3  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  (
( K  x.  M
)  gcd  ( K  x.  N ) )  =  ( ( abs `  K
)  x.  ( ( abs `  M )  gcd  ( abs `  N
) ) ) )
31 gcdabs 12790 . . . . 5  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( abs `  M
)  gcd  ( abs `  N ) )  =  ( M  gcd  N
) )
32313adant1 1046 . . . 4  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  (
( abs `  M
)  gcd  ( abs `  N ) )  =  ( M  gcd  N
) )
3332oveq2d 6104 . . 3  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  (
( abs `  K
)  x.  ( ( abs `  M )  gcd  ( abs `  N
) ) )  =  ( ( abs `  K
)  x.  ( M  gcd  N ) ) )
3430, 33eqtrd 2271 . 2  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  (
( K  x.  M
)  gcd  ( K  x.  N ) )  =  ( ( abs `  K
)  x.  ( M  gcd  N ) ) )
357, 12, 343eqtr4rd 2282 1  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  (
( K  x.  M
)  gcd  ( K  x.  N ) )  =  ( abs `  ( K  x.  ( 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   ` cfv 5380  (class class class)co 6088   CCcc 8183    x. cmul 8190   NN0cn0 9574   ZZcz 9655   abscabs 11785    gcd cgcd 12755
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 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-mulrcl 8284  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-mulass 8288  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-1rid 8292  ax-0id 8293  ax-rnegex 8294  ax-precex 8295  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301  ax-pre-mulgt0 8302  ax-pre-mulext 8303  ax-arch 8304  ax-caucvg 8305
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 7330  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-reap 8911  df-ap 8918  df-div 9011  df-inn 9314  df-2 9372  df-3 9373  df-4 9374  df-n0 9575  df-z 9656  df-uz 9938  df-q 10036  df-rp 10072  df-fz 10429  df-fzo 10567  df-fl 10722  df-mod 10781  df-seqfrec 10906  df-exp 10997  df-cj 11629  df-re 11630  df-im 11631  df-rsqrt 11786  df-abs 11787  df-dvds 12580  df-gcd 12756
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator