Theorem modgcd 12746

Description: The gcd remains unchanged if one operand is replaced with its remainder modulo the other. (Contributed by Paul Chapman, 31-Mar-2011.)

Assertion

Ref	Expression
modgcd	|- ( ( M e. ZZ /\ N e. NN ) -> ( ( M mod N ) gcd N ) = ( M gcd N ) )

Proof of Theorem modgcd

Step	Hyp	Ref	Expression
1		zq 10005	. . . . . . 7 |- ( M e. ZZ -> M e. QQ )
2	1	adantr 276	. . . . . 6 |- ( ( M e. ZZ /\ N e. NN ) -> M e. QQ )
3		nnq 10012	. . . . . . 7 |- ( N e. NN -> N e. QQ )
4	3	adantl 277	. . . . . 6 |- ( ( M e. ZZ /\ N e. NN ) -> N e. QQ )
5		nngt0 9308	. . . . . . 7 |- ( N e. NN -> 0 < N )
6	5	adantl 277	. . . . . 6 |- ( ( M e. ZZ /\ N e. NN ) -> 0 < N )
7		modqval 10739	. . . . . 6 |- ( ( M e. QQ /\ N e. QQ /\ 0 < N ) -> ( M mod N ) = ( M - ( N x. ( |_ ` ( M / N ) ) ) ) )
8	2, 4, 6, 7	syl3anc 1278	. . . . 5 |- ( ( M e. ZZ /\ N e. NN ) -> ( M mod N ) = ( M - ( N x. ( |_ ` ( M / N ) ) ) ) )
9		zcn 9628	. . . . . . 7 |- ( M e. ZZ -> M e. CC )
10	9	adantr 276	. . . . . 6 |- ( ( M e. ZZ /\ N e. NN ) -> M e. CC )
11		nncn 9291	. . . . . . 7 |- ( N e. NN -> N e. CC )
12	11	adantl 277	. . . . . 6 |- ( ( M e. ZZ /\ N e. NN ) -> N e. CC )
13		znq 10003	. . . . . . . 8 |- ( ( M e. ZZ /\ N e. NN ) -> ( M / N ) e. QQ )
14	13	flqcld 10690	. . . . . . 7 |- ( ( M e. ZZ /\ N e. NN ) -> ( |_ ` ( M / N ) ) e. ZZ )
15	14	zcnd 9748	. . . . . 6 |- ( ( M e. ZZ /\ N e. NN ) -> ( |_ ` ( M / N ) ) e. CC )
16		mulneg1 8712	. . . . . . . . . . 11 |- ( ( ( |_ ` ( M / N ) ) e. CC /\ N e. CC ) -> ( -u ( |_ ` ( M / N ) ) x. N ) = -u ( ( |_ ` ( M / N ) ) x. N ) )
17		mulcom 8298	. . . . . . . . . . . 12 |- ( ( ( |_ ` ( M / N ) ) e. CC /\ N e. CC ) -> ( ( |_ ` ( M / N ) ) x. N ) = ( N x. ( |_ ` ( M / N ) ) ) )
18	17	negeqd 8511	. . . . . . . . . . 11 |- ( ( ( |_ ` ( M / N ) ) e. CC /\ N e. CC ) -> -u ( ( |_ ` ( M / N ) ) x. N ) = -u ( N x. ( |_ ` ( M / N ) ) ) )
19	16, 18	eqtrd 2271	. . . . . . . . . 10 |- ( ( ( |_ ` ( M / N ) ) e. CC /\ N e. CC ) -> ( -u ( |_ ` ( M / N ) ) x. N ) = -u ( N x. ( |_ ` ( M / N ) ) ) )
20	19	ancoms 268	. . . . . . . . 9 |- ( ( N e. CC /\ ( |_ ` ( M / N ) ) e. CC ) -> ( -u ( |_ ` ( M / N ) ) x. N ) = -u ( N x. ( |_ ` ( M / N ) ) ) )
21	20	3adant1 1046	. . . . . . . 8 |- ( ( M e. CC /\ N e. CC /\ ( |_ ` ( M / N ) ) e. CC ) -> ( -u ( |_ ` ( M / N ) ) x. N ) = -u ( N x. ( |_ ` ( M / N ) ) ) )
22	21	oveq2d 6091	. . . . . . 7 |- ( ( M e. CC /\ N e. CC /\ ( |_ ` ( M / N ) ) e. CC ) -> ( M + ( -u ( |_ ` ( M / N ) ) x. N ) ) = ( M + -u ( N x. ( |_ ` ( M / N ) ) ) ) )
23		mulcl 8296	. . . . . . . . 9 |- ( ( N e. CC /\ ( |_ ` ( M / N ) ) e. CC ) -> ( N x. ( |_ ` ( M / N ) ) ) e. CC )
24		negsub 8564	. . . . . . . . 9 |- ( ( M e. CC /\ ( N x. ( |_ ` ( M / N ) ) ) e. CC ) -> ( M + -u ( N x. ( |_ ` ( M / N ) ) ) ) = ( M - ( N x. ( |_ ` ( M / N ) ) ) ) )
25	23, 24	sylan2 286	. . . . . . . 8 |- ( ( M e. CC /\ ( N e. CC /\ ( |_ ` ( M / N ) ) e. CC ) ) -> ( M + -u ( N x. ( |_ ` ( M / N ) ) ) ) = ( M - ( N x. ( |_ ` ( M / N ) ) ) ) )
26	25	3impb 1230	. . . . . . 7 |- ( ( M e. CC /\ N e. CC /\ ( |_ ` ( M / N ) ) e. CC ) -> ( M + -u ( N x. ( |_ ` ( M / N ) ) ) ) = ( M - ( N x. ( |_ ` ( M / N ) ) ) ) )
27	22, 26	eqtrd 2271	. . . . . 6 |- ( ( M e. CC /\ N e. CC /\ ( |_ ` ( M / N ) ) e. CC ) -> ( M + ( -u ( |_ ` ( M / N ) ) x. N ) ) = ( M - ( N x. ( |_ ` ( M / N ) ) ) ) )
28	10, 12, 15, 27	syl3anc 1278	. . . . 5 |- ( ( M e. ZZ /\ N e. NN ) -> ( M + ( -u ( |_ ` ( M / N ) ) x. N ) ) = ( M - ( N x. ( |_ ` ( M / N ) ) ) ) )
29	8, 28	eqtr4d 2274	. . . 4 |- ( ( M e. ZZ /\ N e. NN ) -> ( M mod N ) = ( M + ( -u ( |_ ` ( M / N ) ) x. N ) ) )
30	29	oveq2d 6091	. . 3 |- ( ( M e. ZZ /\ N e. NN ) -> ( N gcd ( M mod N ) ) = ( N gcd ( M + ( -u ( |_ ` ( M / N ) ) x. N ) ) ) )
31	14	znegcld 9749	. . . 4 |- ( ( M e. ZZ /\ N e. NN ) -> -u ( |_ ` ( M / N ) ) e. ZZ )
32		nnz 9642	. . . . 5 |- ( N e. NN -> N e. ZZ )
33	32	adantl 277	. . . 4 |- ( ( M e. ZZ /\ N e. NN ) -> N e. ZZ )
34		simpl 109	. . . 4 |- ( ( M e. ZZ /\ N e. NN ) -> M e. ZZ )
35		gcdaddm 12739	. . . 4 |- ( ( -u ( |_ ` ( M / N ) ) e. ZZ /\ N e. ZZ /\ M e. ZZ ) -> ( N gcd M ) = ( N gcd ( M + ( -u ( |_ ` ( M / N ) ) x. N ) ) ) )
36	31, 33, 34, 35	syl3anc 1278	. . 3 |- ( ( M e. ZZ /\ N e. NN ) -> ( N gcd M ) = ( N gcd ( M + ( -u ( |_ ` ( M / N ) ) x. N ) ) ) )
37	30, 36	eqtr4d 2274	. 2 |- ( ( M e. ZZ /\ N e. NN ) -> ( N gcd ( M mod N ) ) = ( N gcd M ) )
38		zmodcl 10759	. . . 4 |- ( ( M e. ZZ /\ N e. NN ) -> ( M mod N ) e. NN0 )
39	38	nn0zd 9745	. . 3 |- ( ( M e. ZZ /\ N e. NN ) -> ( M mod N ) e. ZZ )
40		gcdcom 12728	. . 3 |- ( ( N e. ZZ /\ ( M mod N ) e. ZZ ) -> ( N gcd ( M mod N ) ) = ( ( M mod N ) gcd N ) )
41	33, 39, 40	syl2anc 415	. 2 |- ( ( M e. ZZ /\ N e. NN ) -> ( N gcd ( M mod N ) ) = ( ( M mod N ) gcd N ) )
42		gcdcom 12728	. . 3 |- ( ( N e. ZZ /\ M e. ZZ ) -> ( N gcd M ) = ( M gcd N ) )
43	33, 34, 42	syl2anc 415	. 2 |- ( ( M e. ZZ /\ N e. NN ) -> ( N gcd M ) = ( M gcd N ) )
44	37, 41, 43	3eqtr3d 2279	1 |- ( ( M e. ZZ /\ N e. NN ) -> ( ( M mod N ) gcd N ) = ( M gcd N ) )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1009   = wceq 1402   e. wcel 2209   class class class wbr 4125   ` cfv 5372  (class class class)co 6075   CCcc 8167   0cc0 8169   + caddc 8172   x. cmul 8174   < clt 8350   - cmin 8487   -ucneg 8488   / cdiv 8992   NNcn 9283   ZZcz 9623   QQcq 9998   |_cfl 10681   mod cmo 10737   gcd cgcd 12708

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 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 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285  ax-pre-mulgt0 8286  ax-pre-mulext 8287  ax-arch 8288  ax-caucvg 8289

This theorem depends on definitions:  df-bi 117  df-stab 843  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 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-po 4436  df-iso 4437  df-iord 4506  df-on 4508  df-ilim 4509  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-frec 6652  df-sup 7314  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-reap 8893  df-ap 8900  df-div 8993  df-inn 9284  df-2 9342  df-3 9343  df-4 9344  df-n0 9543  df-z 9624  df-uz 9901  df-q 9999  df-rp 10034  df-fz 10391  df-fzo 10528  df-fl 10683  df-mod 10738  df-seqfrec 10863  df-exp 10954  df-cj 11585  df-re 11586  df-im 11587  df-rsqrt 11742  df-abs 11743  df-dvds 12533  df-gcd 12709

This theorem is referenced by:  eucalginv  12812  phimullem  12981  eulerthlem1  12983  eulerthlemth  12988  pockthlem  13113  gcdmodi  13178