Theorem rpmulgcd 10415

Description: If K and M are relatively prime, then the GCD of K and M x. N is the GCD of K and N. (Contributed by Scott Fenton, 12-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)

Assertion

Ref	Expression
rpmulgcd	|- ( ( ( K e. NN /\ M e. NN /\ N e. NN ) /\ ( K gcd M ) = 1 ) -> ( K gcd ( M x. N ) ) = ( K gcd N ) )

Proof of Theorem rpmulgcd

Step	Hyp	Ref	Expression
1		gcdmultiple 10409	. . . . . 6 |- ( ( K e. NN /\ N e. NN ) -> ( K gcd ( K x. N ) ) = K )
2	1	3adant2 957	. . . . 5 |- ( ( K e. NN /\ M e. NN /\ N e. NN ) -> ( K gcd ( K x. N ) ) = K )
3	2	oveq1d 5547	. . . 4 |- ( ( K e. NN /\ M e. NN /\ N e. NN ) -> ( ( K gcd ( K x. N ) ) gcd ( M x. N ) ) = ( K gcd ( M x. N ) ) )
4		nnz 8370	. . . . . 6 |- ( K e. NN -> K e. ZZ )
5	4	3ad2ant1 959	. . . . 5 |- ( ( K e. NN /\ M e. NN /\ N e. NN ) -> K e. ZZ )
6		nnz 8370	. . . . . . 7 |- ( N e. NN -> N e. ZZ )
7		zmulcl 8404	. . . . . . 7 |- ( ( K e. ZZ /\ N e. ZZ ) -> ( K x. N ) e. ZZ )
8	4, 6, 7	syl2an 283	. . . . . 6 |- ( ( K e. NN /\ N e. NN ) -> ( K x. N ) e. ZZ )
9	8	3adant2 957	. . . . 5 |- ( ( K e. NN /\ M e. NN /\ N e. NN ) -> ( K x. N ) e. ZZ )
10		nnz 8370	. . . . . . 7 |- ( M e. NN -> M e. ZZ )
11		zmulcl 8404	. . . . . . 7 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( M x. N ) e. ZZ )
12	10, 6, 11	syl2an 283	. . . . . 6 |- ( ( M e. NN /\ N e. NN ) -> ( M x. N ) e. ZZ )
13	12	3adant1 956	. . . . 5 |- ( ( K e. NN /\ M e. NN /\ N e. NN ) -> ( M x. N ) e. ZZ )
14		gcdass 10404	. . . . 5 |- ( ( K e. ZZ /\ ( K x. N ) e. ZZ /\ ( M x. N ) e. ZZ ) -> ( ( K gcd ( K x. N ) ) gcd ( M x. N ) ) = ( K gcd ( ( K x. N ) gcd ( M x. N ) ) ) )
15	5, 9, 13, 14	syl3anc 1169	. . . 4 |- ( ( K e. NN /\ M e. NN /\ N e. NN ) -> ( ( K gcd ( K x. N ) ) gcd ( M x. N ) ) = ( K gcd ( ( K x. N ) gcd ( M x. N ) ) ) )
16	3, 15	eqtr3d 2115	. . 3 |- ( ( K e. NN /\ M e. NN /\ N e. NN ) -> ( K gcd ( M x. N ) ) = ( K gcd ( ( K x. N ) gcd ( M x. N ) ) ) )
17	16	adantr 270	. 2 |- ( ( ( K e. NN /\ M e. NN /\ N e. NN ) /\ ( K gcd M ) = 1 ) -> ( K gcd ( M x. N ) ) = ( K gcd ( ( K x. N ) gcd ( M x. N ) ) ) )
18		nnnn0 8295	. . . . . 6 |- ( N e. NN -> N e. NN0 )
19		mulgcdr 10407	. . . . . 6 |- ( ( K e. ZZ /\ M e. ZZ /\ N e. NN0 ) -> ( ( K x. N ) gcd ( M x. N ) ) = ( ( K gcd M ) x. N ) )
20	4, 10, 18, 19	syl3an 1211	. . . . 5 |- ( ( K e. NN /\ M e. NN /\ N e. NN ) -> ( ( K x. N ) gcd ( M x. N ) ) = ( ( K gcd M ) x. N ) )
21		oveq1 5539	. . . . 5 |- ( ( K gcd M ) = 1 -> ( ( K gcd M ) x. N ) = ( 1 x. N ) )
22	20, 21	sylan9eq 2133	. . . 4 |- ( ( ( K e. NN /\ M e. NN /\ N e. NN ) /\ ( K gcd M ) = 1 ) -> ( ( K x. N ) gcd ( M x. N ) ) = ( 1 x. N ) )
23		nncn 8047	. . . . . . 7 |- ( N e. NN -> N e. CC )
24	23	3ad2ant3 961	. . . . . 6 |- ( ( K e. NN /\ M e. NN /\ N e. NN ) -> N e. CC )
25	24	adantr 270	. . . . 5 |- ( ( ( K e. NN /\ M e. NN /\ N e. NN ) /\ ( K gcd M ) = 1 ) -> N e. CC )
26	25	mulid2d 7137	. . . 4 |- ( ( ( K e. NN /\ M e. NN /\ N e. NN ) /\ ( K gcd M ) = 1 ) -> ( 1 x. N ) = N )
27	22, 26	eqtrd 2113	. . 3 |- ( ( ( K e. NN /\ M e. NN /\ N e. NN ) /\ ( K gcd M ) = 1 ) -> ( ( K x. N ) gcd ( M x. N ) ) = N )
28	27	oveq2d 5548	. 2 |- ( ( ( K e. NN /\ M e. NN /\ N e. NN ) /\ ( K gcd M ) = 1 ) -> ( K gcd ( ( K x. N ) gcd ( M x. N ) ) ) = ( K gcd N ) )
29	17, 28	eqtrd 2113	1 |- ( ( ( K e. NN /\ M e. NN /\ N e. NN ) /\ ( K gcd M ) = 1 ) -> ( K gcd ( M x. N ) ) = ( K gcd N ) )

Syntax hints:   -> wi 4   /\ wa 102   /\ w3a 919   = wceq 1284   e. wcel 1433  (class class class)co 5532   CCcc 6979   1c1 6982   x. cmul 6986   NNcn 8039   NN0cn0 8288   ZZcz 8351   gcd cgcd 10338

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-coll 3893  ax-sep 3896  ax-nul 3904  ax-pow 3948  ax-pr 3964  ax-un 4188  ax-setind 4280  ax-iinf 4329  ax-cnex 7067  ax-resscn 7068  ax-1cn 7069  ax-1re 7070  ax-icn 7071  ax-addcl 7072  ax-addrcl 7073  ax-mulcl 7074  ax-mulrcl 7075  ax-addcom 7076  ax-mulcom 7077  ax-addass 7078  ax-mulass 7079  ax-distr 7080  ax-i2m1 7081  ax-0lt1 7082  ax-1rid 7083  ax-0id 7084  ax-rnegex 7085  ax-precex 7086  ax-cnre 7087  ax-pre-ltirr 7088  ax-pre-ltwlin 7089  ax-pre-lttrn 7090  ax-pre-apti 7091  ax-pre-ltadd 7092  ax-pre-mulgt0 7093  ax-pre-mulext 7094  ax-arch 7095  ax-caucvg 7096

This theorem depends on definitions:  df-bi 115  df-dc 776  df-3or 920  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-nel 2340  df-ral 2353  df-rex 2354  df-reu 2355  df-rmo 2356  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-nul 3252  df-if 3352  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-int 3637  df-iun 3680  df-br 3786  df-opab 3840  df-mpt 3841  df-tr 3876  df-id 4048  df-po 4051  df-iso 4052  df-iord 4121  df-on 4123  df-suc 4126  df-iom 4332  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930  df-riota 5488  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-1st 5787  df-2nd 5788  df-recs 5943  df-frec 6001  df-sup 6397  df-pnf 7155  df-mnf 7156  df-xr 7157  df-ltxr 7158  df-le 7159  df-sub 7281  df-neg 7282  df-reap 7675  df-ap 7682  df-div 7761  df-inn 8040  df-2 8098  df-3 8099  df-4 8100  df-n0 8289  df-z 8352  df-uz 8620  df-q 8705  df-rp 8735  df-fz 9030  df-fzo 9153  df-fl 9274  df-mod 9325  df-iseq 9432  df-iexp 9476  df-cj 9729  df-re 9730  df-im 9731  df-rsqrt 9884  df-abs 9885  df-dvds 10196  df-gcd 10339

This theorem is referenced by:  rplpwr  10416