ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  absmulgcd Unicode version
Theorem absmulgcd 12587
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 12536 . . . . 5 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( M gcd N ) e. NN0 )
2 nn0re 9410 . . . . . 6 |- ( ( M gcd N ) e. NN0 -> ( M gcd N ) e. RR )
3 nn0ge0 9426 . . . . . 6 |- ( ( M gcd N ) e. NN0 -> 0 <_ ( M gcd N ) )
42, 3absidd 11727 . . . . 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 6033 . . 3 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( ( abs ` K ) x. ( abs ` ( M gcd N ) ) ) = ( ( abs ` K ) x. ( M gcd N ) ) )
763adant1 1041 . 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 9483 . . . 4 |- ( K e. ZZ -> K e. CC )
91nn0cnd 9456 . . . 4 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( M gcd N ) e. CC )
10 absmul 11629 . . . 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 1225 . 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 9483 . . . . 5 |- ( M e. ZZ -> M e. CC )
14 zcn 9483 . . . . 5 |- ( N e. ZZ -> N e. CC )
15 absmul 11629 . . . . . . 7 |- ( ( K e. CC /\ M e. CC ) -> ( abs ` ( K x. M ) ) = ( ( abs ` K ) x. ( abs ` M ) ) )
16 absmul 11629 . . . . . . 7 |- ( ( K e. CC /\ N e. CC ) -> ( abs ` ( K x. N ) ) = ( ( abs ` K ) x. ( abs ` N ) ) )
1715, 16oveqan12d 6036 . . . . . 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 1329 . . . . 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 1315 . . . 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 9532 . . . . . 6 |- ( ( K e. ZZ /\ M e. ZZ ) -> ( K x. M ) e. ZZ )
21 zmulcl 9532 . . . . . 6 |- ( ( K e. ZZ /\ N e. ZZ ) -> ( K x. N ) e. ZZ )
22 gcdabs 12558 . . . . . 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 1329 . . . 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 11645 . . . . 5 |- ( K e. ZZ -> ( abs ` K ) e. NN0 )
26 zabscl 11646 . . . . 5 |- ( M e. ZZ -> ( abs ` M ) e. ZZ )
27 zabscl 11646 . . . . 5 |- ( N e. ZZ -> ( abs ` N ) e. ZZ )
28 mulgcd 12586 . . . . 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 1315 . . . 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 2272 . . 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 12558 . . . . 5 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( ( abs ` M ) gcd ( abs ` N ) ) = ( M gcd N ) )
32313adant1 1041 . . . 4 |- ( ( K e. ZZ /\ M e. ZZ /\ N e. ZZ ) -> ( ( abs ` M ) gcd ( abs ` N ) ) = ( M gcd N ) )
3332oveq2d 6033 . . 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 2264 . 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 2275 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
Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1004   = wceq 1397   e. wcel 2202   ` cfv 5326  (class class class)co 6017   CCcc 8029   x. cmul 8036   NN0cn0 9401   ZZcz 9478   abscabs 11557   gcd cgcd 12523
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 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-mulrcl 8130  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-precex 8141  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147  ax-pre-mulgt0 8148  ax-pre-mulext 8149  ax-arch 8150  ax-caucvg 8151
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 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-frec 6556  df-sup 7182  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-reap 8754  df-ap 8761  df-div 8852  df-inn 9143  df-2 9201  df-3 9202  df-4 9203  df-n0 9402  df-z 9479  df-uz 9755  df-q 9853  df-rp 9888  df-fz 10243  df-fzo 10377  df-fl 10529  df-mod 10584  df-seqfrec 10709  df-exp 10800  df-cj 11402  df-re 11403  df-im 11404  df-rsqrt 11558  df-abs 11559  df-dvds 12348  df-gcd 12524
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator