ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  gcdmultiplez Unicode version

Theorem gcdmultiplez 11745
Description: Extend gcdmultiple 11744 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
StepHypRef Expression
1 0z 9089 . . . 4  |-  0  e.  ZZ
2 zdceq 9150 . . . 4  |-  ( ( N  e.  ZZ  /\  0  e.  ZZ )  -> DECID  N  =  0 )
31, 2mpan2 422 . . 3  |-  ( N  e.  ZZ  -> DECID  N  =  0
)
4 exmiddc 822 . . 3  |-  (DECID  N  =  0  ->  ( N  =  0  \/  -.  N  =  0 ) )
5 nncn 8752 . . . . . . . 8  |-  ( M  e.  NN  ->  M  e.  CC )
6 mul01 8175 . . . . . . . . 9  |-  ( M  e.  CC  ->  ( M  x.  0 )  =  0 )
76oveq2d 5798 . . . . . . . 8  |-  ( M  e.  CC  ->  ( M  gcd  ( M  x.  0 ) )  =  ( M  gcd  0
) )
85, 7syl 14 . . . . . . 7  |-  ( M  e.  NN  ->  ( M  gcd  ( M  x.  0 ) )  =  ( M  gcd  0
) )
98adantr 274 . . . . . 6  |-  ( ( M  e.  NN  /\  N  e.  ZZ )  ->  ( M  gcd  ( M  x.  0 ) )  =  ( M  gcd  0 ) )
10 nnnn0 9008 . . . . . . . 8  |-  ( M  e.  NN  ->  M  e.  NN0 )
11 nn0gcdid0 11705 . . . . . . . 8  |-  ( M  e.  NN0  ->  ( M  gcd  0 )  =  M )
1210, 11syl 14 . . . . . . 7  |-  ( M  e.  NN  ->  ( M  gcd  0 )  =  M )
1312adantr 274 . . . . . 6  |-  ( ( M  e.  NN  /\  N  e.  ZZ )  ->  ( M  gcd  0
)  =  M )
149, 13eqtrd 2173 . . . . 5  |-  ( ( M  e.  NN  /\  N  e.  ZZ )  ->  ( M  gcd  ( M  x.  0 ) )  =  M )
15 oveq2 5790 . . . . . . 7  |-  ( N  =  0  ->  ( M  x.  N )  =  ( M  x.  0 ) )
1615oveq2d 5798 . . . . . 6  |-  ( N  =  0  ->  ( M  gcd  ( M  x.  N ) )  =  ( M  gcd  ( M  x.  0 ) ) )
1716eqeq1d 2149 . . . . 5  |-  ( N  =  0  ->  (
( M  gcd  ( M  x.  N )
)  =  M  <->  ( M  gcd  ( M  x.  0 ) )  =  M ) )
1814, 17syl5ibr 155 . . . 4  |-  ( N  =  0  ->  (
( M  e.  NN  /\  N  e.  ZZ )  ->  ( M  gcd  ( M  x.  N
) )  =  M ) )
19 df-ne 2310 . . . . 5  |-  ( N  =/=  0  <->  -.  N  =  0 )
20 zcn 9083 . . . . . . . . . . 11  |-  ( N  e.  ZZ  ->  N  e.  CC )
21 absmul 10873 . . . . . . . . . . 11  |-  ( ( M  e.  CC  /\  N  e.  CC )  ->  ( abs `  ( M  x.  N )
)  =  ( ( abs `  M )  x.  ( abs `  N
) ) )
225, 20, 21syl2an 287 . . . . . . . . . 10  |-  ( ( M  e.  NN  /\  N  e.  ZZ )  ->  ( abs `  ( M  x.  N )
)  =  ( ( abs `  M )  x.  ( abs `  N
) ) )
23 nnre 8751 . . . . . . . . . . . . 13  |-  ( M  e.  NN  ->  M  e.  RR )
2410nn0ge0d 9057 . . . . . . . . . . . . 13  |-  ( M  e.  NN  ->  0  <_  M )
2523, 24absidd 10971 . . . . . . . . . . . 12  |-  ( M  e.  NN  ->  ( abs `  M )  =  M )
2625oveq1d 5797 . . . . . . . . . . 11  |-  ( M  e.  NN  ->  (
( abs `  M
)  x.  ( abs `  N ) )  =  ( M  x.  ( abs `  N ) ) )
2726adantr 274 . . . . . . . . . 10  |-  ( ( M  e.  NN  /\  N  e.  ZZ )  ->  ( ( abs `  M
)  x.  ( abs `  N ) )  =  ( M  x.  ( abs `  N ) ) )
2822, 27eqtrd 2173 . . . . . . . . 9  |-  ( ( M  e.  NN  /\  N  e.  ZZ )  ->  ( abs `  ( M  x.  N )
)  =  ( M  x.  ( abs `  N
) ) )
2928oveq2d 5798 . . . . . . . 8  |-  ( ( M  e.  NN  /\  N  e.  ZZ )  ->  ( M  gcd  ( abs `  ( M  x.  N ) ) )  =  ( M  gcd  ( M  x.  ( abs `  N ) ) ) )
3029adantr 274 . . . . . . 7  |-  ( ( ( M  e.  NN  /\  N  e.  ZZ )  /\  N  =/=  0
)  ->  ( M  gcd  ( abs `  ( M  x.  N )
) )  =  ( M  gcd  ( M  x.  ( abs `  N
) ) ) )
31 simpll 519 . . . . . . . . 9  |-  ( ( ( M  e.  NN  /\  N  e.  ZZ )  /\  N  =/=  0
)  ->  M  e.  NN )
3231nnzd 9196 . . . . . . . 8  |-  ( ( ( M  e.  NN  /\  N  e.  ZZ )  /\  N  =/=  0
)  ->  M  e.  ZZ )
33 nnz 9097 . . . . . . . . . 10  |-  ( M  e.  NN  ->  M  e.  ZZ )
34 zmulcl 9131 . . . . . . . . . 10  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  x.  N
)  e.  ZZ )
3533, 34sylan 281 . . . . . . . . 9  |-  ( ( M  e.  NN  /\  N  e.  ZZ )  ->  ( M  x.  N
)  e.  ZZ )
3635adantr 274 . . . . . . . 8  |-  ( ( ( M  e.  NN  /\  N  e.  ZZ )  /\  N  =/=  0
)  ->  ( M  x.  N )  e.  ZZ )
37 gcdabs2 11714 . . . . . . . 8  |-  ( ( M  e.  ZZ  /\  ( M  x.  N
)  e.  ZZ )  ->  ( M  gcd  ( abs `  ( M  x.  N ) ) )  =  ( M  gcd  ( M  x.  N ) ) )
3832, 36, 37syl2anc 409 . . . . . . 7  |-  ( ( ( M  e.  NN  /\  N  e.  ZZ )  /\  N  =/=  0
)  ->  ( M  gcd  ( abs `  ( M  x.  N )
) )  =  ( M  gcd  ( M  x.  N ) ) )
39 nnabscl 10904 . . . . . . . . 9  |-  ( ( N  e.  ZZ  /\  N  =/=  0 )  -> 
( abs `  N
)  e.  NN )
40 gcdmultiple 11744 . . . . . . . . 9  |-  ( ( M  e.  NN  /\  ( abs `  N )  e.  NN )  -> 
( M  gcd  ( M  x.  ( abs `  N ) ) )  =  M )
4139, 40sylan2 284 . . . . . . . 8  |-  ( ( M  e.  NN  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  ->  ( M  gcd  ( M  x.  ( abs `  N ) ) )  =  M )
4241anassrs 398 . . . . . . 7  |-  ( ( ( M  e.  NN  /\  N  e.  ZZ )  /\  N  =/=  0
)  ->  ( M  gcd  ( M  x.  ( abs `  N ) ) )  =  M )
4330, 38, 423eqtr3d 2181 . . . . . 6  |-  ( ( ( M  e.  NN  /\  N  e.  ZZ )  /\  N  =/=  0
)  ->  ( M  gcd  ( M  x.  N
) )  =  M )
4443expcom 115 . . . . 5  |-  ( N  =/=  0  ->  (
( M  e.  NN  /\  N  e.  ZZ )  ->  ( M  gcd  ( M  x.  N
) )  =  M ) )
4519, 44sylbir 134 . . . 4  |-  ( -.  N  =  0  -> 
( ( M  e.  NN  /\  N  e.  ZZ )  ->  ( M  gcd  ( M  x.  N ) )  =  M ) )
4618, 45jaoi 706 . . 3  |-  ( ( N  =  0  \/ 
-.  N  =  0 )  ->  ( ( M  e.  NN  /\  N  e.  ZZ )  ->  ( M  gcd  ( M  x.  N ) )  =  M ) )
473, 4, 463syl 17 . 2  |-  ( N  e.  ZZ  ->  (
( M  e.  NN  /\  N  e.  ZZ )  ->  ( M  gcd  ( M  x.  N
) )  =  M ) )
4847anabsi7 571 1  |-  ( ( M  e.  NN  /\  N  e.  ZZ )  ->  ( M  gcd  ( M  x.  N )
)  =  M )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    \/ wo 698  DECID wdc 820    = wceq 1332    e. wcel 1481    =/= wne 2309   ` cfv 5131  (class class class)co 5782   CCcc 7642   0cc0 7644    x. cmul 7649   NNcn 8744   NN0cn0 9001   ZZcz 9078   abscabs 10801    gcd cgcd 11671
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-coll 4051  ax-sep 4054  ax-nul 4062  ax-pow 4106  ax-pr 4139  ax-un 4363  ax-setind 4460  ax-iinf 4510  ax-cnex 7735  ax-resscn 7736  ax-1cn 7737  ax-1re 7738  ax-icn 7739  ax-addcl 7740  ax-addrcl 7741  ax-mulcl 7742  ax-mulrcl 7743  ax-addcom 7744  ax-mulcom 7745  ax-addass 7746  ax-mulass 7747  ax-distr 7748  ax-i2m1 7749  ax-0lt1 7750  ax-1rid 7751  ax-0id 7752  ax-rnegex 7753  ax-precex 7754  ax-cnre 7755  ax-pre-ltirr 7756  ax-pre-ltwlin 7757  ax-pre-lttrn 7758  ax-pre-apti 7759  ax-pre-ltadd 7760  ax-pre-mulgt0 7761  ax-pre-mulext 7762  ax-arch 7763  ax-caucvg 7764
This theorem depends on definitions:  df-bi 116  df-stab 817  df-dc 821  df-3or 964  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-nel 2405  df-ral 2422  df-rex 2423  df-reu 2424  df-rmo 2425  df-rab 2426  df-v 2691  df-sbc 2914  df-csb 3008  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-nul 3369  df-if 3480  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-int 3780  df-iun 3823  df-br 3938  df-opab 3998  df-mpt 3999  df-tr 4035  df-id 4223  df-po 4226  df-iso 4227  df-iord 4296  df-on 4298  df-ilim 4299  df-suc 4301  df-iom 4513  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-f1 5136  df-fo 5137  df-f1o 5138  df-fv 5139  df-riota 5738  df-ov 5785  df-oprab 5786  df-mpo 5787  df-1st 6046  df-2nd 6047  df-recs 6210  df-frec 6296  df-sup 6879  df-pnf 7826  df-mnf 7827  df-xr 7828  df-ltxr 7829  df-le 7830  df-sub 7959  df-neg 7960  df-reap 8361  df-ap 8368  df-div 8457  df-inn 8745  df-2 8803  df-3 8804  df-4 8805  df-n0 9002  df-z 9079  df-uz 9351  df-q 9439  df-rp 9471  df-fz 9822  df-fzo 9951  df-fl 10074  df-mod 10127  df-seqfrec 10250  df-exp 10324  df-cj 10646  df-re 10647  df-im 10648  df-rsqrt 10802  df-abs 10803  df-dvds 11530  df-gcd 11672
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator