Theorem gcdmultiplez 12653

Description: Extend gcdmultiple 12652 so N can be an integer. (Contributed by Scott Fenton, 18-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)

Assertion

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

Proof of Theorem gcdmultiplez

Step	Hyp	Ref	Expression
1		0z 9533	. . . 4 |- 0 e. ZZ
2		zdceq 9598	. . . 4 |- ( ( N e. ZZ /\ 0 e. ZZ ) -> DECID N = 0 )
3	1, 2	mpan2 425	. . 3 |- ( N e. ZZ -> DECID N = 0 )
4		exmiddc 844	. . 3 |- (DECID N = 0 -> ( N = 0 \/ -. N = 0 ) )
5		nncn 9194	. . . . . . . 8 |- ( M e. NN -> M e. CC )
6		mul01 8611	. . . . . . . . 9 |- ( M e. CC -> ( M x. 0 ) = 0 )
7	6	oveq2d 6044	. . . . . . . 8 |- ( M e. CC -> ( M gcd ( M x. 0 ) ) = ( M gcd 0 ) )
8	5, 7	syl 14	. . . . . . 7 |- ( M e. NN -> ( M gcd ( M x. 0 ) ) = ( M gcd 0 ) )
9	8	adantr 276	. . . . . 6 |- ( ( M e. NN /\ N e. ZZ ) -> ( M gcd ( M x. 0 ) ) = ( M gcd 0 ) )
10		nnnn0 9452	. . . . . . . 8 |- ( M e. NN -> M e. NN0 )
11		nn0gcdid0 12613	. . . . . . . 8 |- ( M e. NN0 -> ( M gcd 0 ) = M )
12	10, 11	syl 14	. . . . . . 7 |- ( M e. NN -> ( M gcd 0 ) = M )
13	12	adantr 276	. . . . . 6 |- ( ( M e. NN /\ N e. ZZ ) -> ( M gcd 0 ) = M )
14	9, 13	eqtrd 2264	. . . . 5 |- ( ( M e. NN /\ N e. ZZ ) -> ( M gcd ( M x. 0 ) ) = M )
15		oveq2 6036	. . . . . . 7 |- ( N = 0 -> ( M x. N ) = ( M x. 0 ) )
16	15	oveq2d 6044	. . . . . 6 |- ( N = 0 -> ( M gcd ( M x. N ) ) = ( M gcd ( M x. 0 ) ) )
17	16	eqeq1d 2240	. . . . 5 |- ( N = 0 -> ( ( M gcd ( M x. N ) ) = M <-> ( M gcd ( M x. 0 ) ) = M ) )
18	14, 17	imbitrrid 156	. . . 4 |- ( N = 0 -> ( ( M e. NN /\ N e. ZZ ) -> ( M gcd ( M x. N ) ) = M ) )
19		df-ne 2404	. . . . 5 |- ( N =/= 0 <-> -. N = 0 )
20		zcn 9527	. . . . . . . . . . 11 |- ( N e. ZZ -> N e. CC )
21		absmul 11690	. . . . . . . . . . 11 |- ( ( M e. CC /\ N e. CC ) -> ( abs ` ( M x. N ) ) = ( ( abs ` M ) x. ( abs ` N ) ) )
22	5, 20, 21	syl2an 289	. . . . . . . . . 10 |- ( ( M e. NN /\ N e. ZZ ) -> ( abs ` ( M x. N ) ) = ( ( abs ` M ) x. ( abs ` N ) ) )
23		nnre 9193	. . . . . . . . . . . . 13 |- ( M e. NN -> M e. RR )
24	10	nn0ge0d 9501	. . . . . . . . . . . . 13 |- ( M e. NN -> 0 <_ M )
25	23, 24	absidd 11788	. . . . . . . . . . . 12 |- ( M e. NN -> ( abs ` M ) = M )
26	25	oveq1d 6043	. . . . . . . . . . 11 |- ( M e. NN -> ( ( abs ` M ) x. ( abs ` N ) ) = ( M x. ( abs ` N ) ) )
27	26	adantr 276	. . . . . . . . . 10 |- ( ( M e. NN /\ N e. ZZ ) -> ( ( abs ` M ) x. ( abs ` N ) ) = ( M x. ( abs ` N ) ) )
28	22, 27	eqtrd 2264	. . . . . . . . 9 |- ( ( M e. NN /\ N e. ZZ ) -> ( abs ` ( M x. N ) ) = ( M x. ( abs ` N ) ) )
29	28	oveq2d 6044	. . . . . . . 8 |- ( ( M e. NN /\ N e. ZZ ) -> ( M gcd ( abs ` ( M x. N ) ) ) = ( M gcd ( M x. ( abs ` N ) ) ) )
30	29	adantr 276	. . . . . . 7 |- ( ( ( M e. NN /\ N e. ZZ ) /\ N =/= 0 ) -> ( M gcd ( abs ` ( M x. N ) ) ) = ( M gcd ( M x. ( abs ` N ) ) ) )
31		simpll 527	. . . . . . . . 9 |- ( ( ( M e. NN /\ N e. ZZ ) /\ N =/= 0 ) -> M e. NN )
32	31	nnzd 9644	. . . . . . . 8 |- ( ( ( M e. NN /\ N e. ZZ ) /\ N =/= 0 ) -> M e. ZZ )
33		nnz 9541	. . . . . . . . . 10 |- ( M e. NN -> M e. ZZ )
34		zmulcl 9576	. . . . . . . . . 10 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( M x. N ) e. ZZ )
35	33, 34	sylan 283	. . . . . . . . 9 |- ( ( M e. NN /\ N e. ZZ ) -> ( M x. N ) e. ZZ )
36	35	adantr 276	. . . . . . . 8 |- ( ( ( M e. NN /\ N e. ZZ ) /\ N =/= 0 ) -> ( M x. N ) e. ZZ )
37		gcdabs2 12622	. . . . . . . 8 |- ( ( M e. ZZ /\ ( M x. N ) e. ZZ ) -> ( M gcd ( abs ` ( M x. N ) ) ) = ( M gcd ( M x. N ) ) )
38	32, 36, 37	syl2anc 411	. . . . . . 7 |- ( ( ( M e. NN /\ N e. ZZ ) /\ N =/= 0 ) -> ( M gcd ( abs ` ( M x. N ) ) ) = ( M gcd ( M x. N ) ) )
39		nnabscl 11721	. . . . . . . . 9 |- ( ( N e. ZZ /\ N =/= 0 ) -> ( abs ` N ) e. NN )
40		gcdmultiple 12652	. . . . . . . . 9 |- ( ( M e. NN /\ ( abs ` N ) e. NN ) -> ( M gcd ( M x. ( abs ` N ) ) ) = M )
41	39, 40	sylan2 286	. . . . . . . 8 |- ( ( M e. NN /\ ( N e. ZZ /\ N =/= 0 ) ) -> ( M gcd ( M x. ( abs ` N ) ) ) = M )
42	41	anassrs 400	. . . . . . 7 |- ( ( ( M e. NN /\ N e. ZZ ) /\ N =/= 0 ) -> ( M gcd ( M x. ( abs ` N ) ) ) = M )
43	30, 38, 42	3eqtr3d 2272	. . . . . 6 |- ( ( ( M e. NN /\ N e. ZZ ) /\ N =/= 0 ) -> ( M gcd ( M x. N ) ) = M )
44	43	expcom 116	. . . . 5 |- ( N =/= 0 -> ( ( M e. NN /\ N e. ZZ ) -> ( M gcd ( M x. N ) ) = M ) )
45	19, 44	sylbir 135	. . . 4 |- ( -. N = 0 -> ( ( M e. NN /\ N e. ZZ ) -> ( M gcd ( M x. N ) ) = M ) )
46	18, 45	jaoi 724	. . 3 |- ( ( N = 0 \/ -. N = 0 ) -> ( ( M e. NN /\ N e. ZZ ) -> ( M gcd ( M x. N ) ) = M ) )
47	3, 4, 46	3syl 17	. 2 |- ( N e. ZZ -> ( ( M e. NN /\ N e. ZZ ) -> ( M gcd ( M x. N ) ) = M ) )
48	47	anabsi7 583	1 |- ( ( M e. NN /\ N e. ZZ ) -> ( M gcd ( M x. N ) ) = M )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   \/ wo 716  DECID wdc 842   = wceq 1398   e. wcel 2202   =/= wne 2403   ` cfv 5333  (class class class)co 6028   CCcc 8073   0cc0 8075   x. cmul 8080   NNcn 9186   NN0cn0 9445   ZZcz 9522   abscabs 11618   gcd cgcd 12585

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-mulrcl 8174  ax-addcom 8175  ax-mulcom 8176  ax-addass 8177  ax-mulass 8178  ax-distr 8179  ax-i2m1 8180  ax-0lt1 8181  ax-1rid 8182  ax-0id 8183  ax-rnegex 8184  ax-precex 8185  ax-cnre 8186  ax-pre-ltirr 8187  ax-pre-ltwlin 8188  ax-pre-lttrn 8189  ax-pre-apti 8190  ax-pre-ltadd 8191  ax-pre-mulgt0 8192  ax-pre-mulext 8193  ax-arch 8194  ax-caucvg 8195

This theorem depends on definitions:  df-bi 117  df-stab 839  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-po 4399  df-iso 4400  df-iord 4469  df-on 4471  df-ilim 4472  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-frec 6600  df-sup 7226  df-pnf 8259  df-mnf 8260  df-xr 8261  df-ltxr 8262  df-le 8263  df-sub 8395  df-neg 8396  df-reap 8798  df-ap 8805  df-div 8896  df-inn 9187  df-2 9245  df-3 9246  df-4 9247  df-n0 9446  df-z 9523  df-uz 9799  df-q 9897  df-rp 9932  df-fz 10287  df-fzo 10421  df-fl 10574  df-mod 10629  df-seqfrec 10754  df-exp 10845  df-cj 11463  df-re 11464  df-im 11465  df-rsqrt 11619  df-abs 11620  df-dvds 12410  df-gcd 12586

This theorem is referenced by: (None)