Theorem modgcd 12507

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 9817	. . . . . . 7 |- ( M e. ZZ -> M e. QQ )
2	1	adantr 276	. . . . . 6 |- ( ( M e. ZZ /\ N e. NN ) -> M e. QQ )
3		nnq 9824	. . . . . . 7 |- ( N e. NN -> N e. QQ )
4	3	adantl 277	. . . . . 6 |- ( ( M e. ZZ /\ N e. NN ) -> N e. QQ )
5		nngt0 9131	. . . . . . 7 |- ( N e. NN -> 0 < N )
6	5	adantl 277	. . . . . 6 |- ( ( M e. ZZ /\ N e. NN ) -> 0 < N )
7		modqval 10541	. . . . . 6 |- ( ( M e. QQ /\ N e. QQ /\ 0 < N ) -> ( M mod N ) = ( M - ( N x. ( |_ ` ( M / N ) ) ) ) )
8	2, 4, 6, 7	syl3anc 1271	. . . . 5 |- ( ( M e. ZZ /\ N e. NN ) -> ( M mod N ) = ( M - ( N x. ( |_ ` ( M / N ) ) ) ) )
9		zcn 9447	. . . . . . 7 |- ( M e. ZZ -> M e. CC )
10	9	adantr 276	. . . . . 6 |- ( ( M e. ZZ /\ N e. NN ) -> M e. CC )
11		nncn 9114	. . . . . . 7 |- ( N e. NN -> N e. CC )
12	11	adantl 277	. . . . . 6 |- ( ( M e. ZZ /\ N e. NN ) -> N e. CC )
13		znq 9815	. . . . . . . 8 |- ( ( M e. ZZ /\ N e. NN ) -> ( M / N ) e. QQ )
14	13	flqcld 10492	. . . . . . 7 |- ( ( M e. ZZ /\ N e. NN ) -> ( |_ ` ( M / N ) ) e. ZZ )
15	14	zcnd 9566	. . . . . 6 |- ( ( M e. ZZ /\ N e. NN ) -> ( |_ ` ( M / N ) ) e. CC )
16		mulneg1 8537	. . . . . . . . . . 11 |- ( ( ( |_ ` ( M / N ) ) e. CC /\ N e. CC ) -> ( -u ( |_ ` ( M / N ) ) x. N ) = -u ( ( |_ ` ( M / N ) ) x. N ) )
17		mulcom 8124	. . . . . . . . . . . 12 |- ( ( ( |_ ` ( M / N ) ) e. CC /\ N e. CC ) -> ( ( |_ ` ( M / N ) ) x. N ) = ( N x. ( |_ ` ( M / N ) ) ) )
18	17	negeqd 8337	. . . . . . . . . . 11 |- ( ( ( |_ ` ( M / N ) ) e. CC /\ N e. CC ) -> -u ( ( |_ ` ( M / N ) ) x. N ) = -u ( N x. ( |_ ` ( M / N ) ) ) )
19	16, 18	eqtrd 2262	. . . . . . . . . 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 1039	. . . . . . . 8 |- ( ( M e. CC /\ N e. CC /\ ( |_ ` ( M / N ) ) e. CC ) -> ( -u ( |_ ` ( M / N ) ) x. N ) = -u ( N x. ( |_ ` ( M / N ) ) ) )
22	21	oveq2d 6016	. . . . . . 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 8122	. . . . . . . . 9 |- ( ( N e. CC /\ ( |_ ` ( M / N ) ) e. CC ) -> ( N x. ( |_ ` ( M / N ) ) ) e. CC )
24		negsub 8390	. . . . . . . . 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 1223	. . . . . . 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 2262	. . . . . 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 1271	. . . . 5 |- ( ( M e. ZZ /\ N e. NN ) -> ( M + ( -u ( |_ ` ( M / N ) ) x. N ) ) = ( M - ( N x. ( |_ ` ( M / N ) ) ) ) )
29	8, 28	eqtr4d 2265	. . . 4 |- ( ( M e. ZZ /\ N e. NN ) -> ( M mod N ) = ( M + ( -u ( |_ ` ( M / N ) ) x. N ) ) )
30	29	oveq2d 6016	. . 3 |- ( ( M e. ZZ /\ N e. NN ) -> ( N gcd ( M mod N ) ) = ( N gcd ( M + ( -u ( |_ ` ( M / N ) ) x. N ) ) ) )
31	14	znegcld 9567	. . . 4 |- ( ( M e. ZZ /\ N e. NN ) -> -u ( |_ ` ( M / N ) ) e. ZZ )
32		nnz 9461	. . . . 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 12500	. . . 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 1271	. . 3 |- ( ( M e. ZZ /\ N e. NN ) -> ( N gcd M ) = ( N gcd ( M + ( -u ( |_ ` ( M / N ) ) x. N ) ) ) )
37	30, 36	eqtr4d 2265	. 2 |- ( ( M e. ZZ /\ N e. NN ) -> ( N gcd ( M mod N ) ) = ( N gcd M ) )
38		zmodcl 10561	. . . 4 |- ( ( M e. ZZ /\ N e. NN ) -> ( M mod N ) e. NN0 )
39	38	nn0zd 9563	. . 3 |- ( ( M e. ZZ /\ N e. NN ) -> ( M mod N ) e. ZZ )
40		gcdcom 12489	. . 3 |- ( ( N e. ZZ /\ ( M mod N ) e. ZZ ) -> ( N gcd ( M mod N ) ) = ( ( M mod N ) gcd N ) )
41	33, 39, 40	syl2anc 411	. 2 |- ( ( M e. ZZ /\ N e. NN ) -> ( N gcd ( M mod N ) ) = ( ( M mod N ) gcd N ) )
42		gcdcom 12489	. . 3 |- ( ( N e. ZZ /\ M e. ZZ ) -> ( N gcd M ) = ( M gcd N ) )
43	33, 34, 42	syl2anc 411	. 2 |- ( ( M e. ZZ /\ N e. NN ) -> ( N gcd M ) = ( M gcd N ) )
44	37, 41, 43	3eqtr3d 2270	1 |- ( ( M e. ZZ /\ N e. NN ) -> ( ( M mod N ) gcd N ) = ( M gcd N ) )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1002   = wceq 1395   e. wcel 2200   class class class wbr 4082   ` cfv 5317  (class class class)co 6000   CCcc 7993   0cc0 7995   + caddc 7998   x. cmul 8000   < clt 8177   - cmin 8313   -ucneg 8314   / cdiv 8815   NNcn 9106   ZZcz 9442   QQcq 9810   |_cfl 10483   mod cmo 10539   gcd cgcd 12469

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4198  ax-sep 4201  ax-nul 4209  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-iinf 4679  ax-cnex 8086  ax-resscn 8087  ax-1cn 8088  ax-1re 8089  ax-icn 8090  ax-addcl 8091  ax-addrcl 8092  ax-mulcl 8093  ax-mulrcl 8094  ax-addcom 8095  ax-mulcom 8096  ax-addass 8097  ax-mulass 8098  ax-distr 8099  ax-i2m1 8100  ax-0lt1 8101  ax-1rid 8102  ax-0id 8103  ax-rnegex 8104  ax-precex 8105  ax-cnre 8106  ax-pre-ltirr 8107  ax-pre-ltwlin 8108  ax-pre-lttrn 8109  ax-pre-apti 8110  ax-pre-ltadd 8111  ax-pre-mulgt0 8112  ax-pre-mulext 8113  ax-arch 8114  ax-caucvg 8115

This theorem depends on definitions:  df-bi 117  df-stab 836  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-tr 4182  df-id 4383  df-po 4386  df-iso 4387  df-iord 4456  df-on 4458  df-ilim 4459  df-suc 4461  df-iom 4682  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-recs 6449  df-frec 6535  df-sup 7147  df-pnf 8179  df-mnf 8180  df-xr 8181  df-ltxr 8182  df-le 8183  df-sub 8315  df-neg 8316  df-reap 8718  df-ap 8725  df-div 8816  df-inn 9107  df-2 9165  df-3 9166  df-4 9167  df-n0 9366  df-z 9443  df-uz 9719  df-q 9811  df-rp 9846  df-fz 10201  df-fzo 10335  df-fl 10485  df-mod 10540  df-seqfrec 10665  df-exp 10756  df-cj 11348  df-re 11349  df-im 11350  df-rsqrt 11504  df-abs 11505  df-dvds 12294  df-gcd 12470

This theorem is referenced by:  eucalginv  12573  phimullem  12742  eulerthlem1  12744  eulerthlemth  12749  pockthlem  12874  gcdmodi  12939