Theorem gcdmultiplez 12742

Description: Extend gcdmultiple 12741 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 9605	. . . 4 |- 0 e. ZZ
2		zdceq 9670	. . . 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 9262	. . . . . . . 8 |- ( M e. NN -> M e. CC )
6		mul01 8679	. . . . . . . . 9 |- ( M e. CC -> ( M x. 0 ) = 0 )
7	6	oveq2d 6074	. . . . . . . 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 9520	. . . . . . . 8 |- ( M e. NN -> M e. NN0 )
11		nn0gcdid0 12702	. . . . . . . 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 2267	. . . . 5 |- ( ( M e. NN /\ N e. ZZ ) -> ( M gcd ( M x. 0 ) ) = M )
15		oveq2 6066	. . . . . . 7 |- ( N = 0 -> ( M x. N ) = ( M x. 0 ) )
16	15	oveq2d 6074	. . . . . 6 |- ( N = 0 -> ( M gcd ( M x. N ) ) = ( M gcd ( M x. 0 ) ) )
17	16	eqeq1d 2243	. . . . 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 2415	. . . . 5 |- ( N =/= 0 <-> -. N = 0 )
20		zcn 9599	. . . . . . . . . . 11 |- ( N e. ZZ -> N e. CC )
21		absmul 11779	. . . . . . . . . . 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 9261	. . . . . . . . . . . . 13 |- ( M e. NN -> M e. RR )
24	10	nn0ge0d 9573	. . . . . . . . . . . . 13 |- ( M e. NN -> 0 <_ M )
25	23, 24	absidd 11877	. . . . . . . . . . . 12 |- ( M e. NN -> ( abs ` M ) = M )
26	25	oveq1d 6073	. . . . . . . . . . 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 2267	. . . . . . . . 9 |- ( ( M e. NN /\ N e. ZZ ) -> ( abs ` ( M x. N ) ) = ( M x. ( abs ` N ) ) )
29	28	oveq2d 6074	. . . . . . . 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 9717	. . . . . . . 8 |- ( ( ( M e. NN /\ N e. ZZ ) /\ N =/= 0 ) -> M e. ZZ )
33		nnz 9613	. . . . . . . . . 10 |- ( M e. NN -> M e. ZZ )
34		zmulcl 9648	. . . . . . . . . 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 12711	. . . . . . . 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 11810	. . . . . . . . 9 |- ( ( N e. ZZ /\ N =/= 0 ) -> ( abs ` N ) e. NN )
40		gcdmultiple 12741	. . . . . . . . 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 2275	. . . . . 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 2205   =/= wne 2414   ` cfv 5357  (class class class)co 6058   CCcc 8141   0cc0 8143   x. cmul 8148   NNcn 9254   NN0cn0 9513   ZZcz 9594   abscabs 11707   gcd cgcd 12674

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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-mulrcl 8242  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-precex 8253  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259  ax-pre-mulgt0 8260  ax-pre-mulext 8261  ax-arch 8262  ax-caucvg 8263

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 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-frec 6635  df-sup 7288  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-reap 8866  df-ap 8873  df-div 8964  df-inn 9255  df-2 9313  df-3 9314  df-4 9315  df-n0 9514  df-z 9595  df-uz 9872  df-q 9970  df-rp 10005  df-fz 10362  df-fzo 10499  df-fl 10654  df-mod 10709  df-seqfrec 10834  df-exp 10925  df-cj 11552  df-re 11553  df-im 11554  df-rsqrt 11708  df-abs 11709  df-dvds 12499  df-gcd 12675

This theorem is referenced by: (None)