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

Theorem mulgz 13930
Description: A group multiple of the identity, for integer multiple. (Contributed by Mario Carneiro, 13-Dec-2014.)
Hypotheses
Ref Expression
mulgnn0z.b  |-  B  =  ( Base `  G
)
mulgnn0z.t  |-  .x.  =  (.g
`  G )
mulgnn0z.o  |-  .0.  =  ( 0g `  G )
Assertion
Ref Expression
mulgz  |-  ( ( G  e.  Grp  /\  N  e.  ZZ )  ->  ( N  .x.  .0.  )  =  .0.  )

Proof of Theorem mulgz
StepHypRef Expression
1 grpmnd 13789 . . . 4  |-  ( G  e.  Grp  ->  G  e.  Mnd )
21adantr 276 . . 3  |-  ( ( G  e.  Grp  /\  N  e.  ZZ )  ->  G  e.  Mnd )
3 mulgnn0z.b . . . 4  |-  B  =  ( Base `  G
)
4 mulgnn0z.t . . . 4  |-  .x.  =  (.g
`  G )
5 mulgnn0z.o . . . 4  |-  .0.  =  ( 0g `  G )
63, 4, 5mulgnn0z 13929 . . 3  |-  ( ( G  e.  Mnd  /\  N  e.  NN0 )  -> 
( N  .x.  .0.  )  =  .0.  )
72, 6sylan 283 . 2  |-  ( ( ( G  e.  Grp  /\  N  e.  ZZ )  /\  N  e.  NN0 )  ->  ( N  .x.  .0.  )  =  .0.  )
8 simpll 531 . . . 4  |-  ( ( ( G  e.  Grp  /\  N  e.  ZZ )  /\  -u N  e.  NN0 )  ->  G  e.  Grp )
9 nn0z 9643 . . . . 5  |-  ( -u N  e.  NN0  ->  -u N  e.  ZZ )
109adantl 277 . . . 4  |-  ( ( ( G  e.  Grp  /\  N  e.  ZZ )  /\  -u N  e.  NN0 )  ->  -u N  e.  ZZ )
113, 5grpidcl 13811 . . . . 5  |-  ( G  e.  Grp  ->  .0.  e.  B )
1211ad2antrr 492 . . . 4  |-  ( ( ( G  e.  Grp  /\  N  e.  ZZ )  /\  -u N  e.  NN0 )  ->  .0.  e.  B
)
13 eqid 2238 . . . . 5  |-  ( invg `  G )  =  ( invg `  G )
143, 4, 13mulgneg 13920 . . . 4  |-  ( ( G  e.  Grp  /\  -u N  e.  ZZ  /\  .0.  e.  B )  -> 
( -u -u N  .x.  .0.  )  =  ( ( invg `  G ) `
 ( -u N  .x.  .0.  ) ) )
158, 10, 12, 14syl3anc 1278 . . 3  |-  ( ( ( G  e.  Grp  /\  N  e.  ZZ )  /\  -u N  e.  NN0 )  ->  ( -u -u N  .x.  .0.  )  =  ( ( invg `  G ) `  ( -u N  .x.  .0.  )
) )
16 zcn 9628 . . . . . 6  |-  ( N  e.  ZZ  ->  N  e.  CC )
1716ad2antlr 493 . . . . 5  |-  ( ( ( G  e.  Grp  /\  N  e.  ZZ )  /\  -u N  e.  NN0 )  ->  N  e.  CC )
1817negnegd 8618 . . . 4  |-  ( ( ( G  e.  Grp  /\  N  e.  ZZ )  /\  -u N  e.  NN0 )  ->  -u -u N  =  N )
1918oveq1d 6090 . . 3  |-  ( ( ( G  e.  Grp  /\  N  e.  ZZ )  /\  -u N  e.  NN0 )  ->  ( -u -u N  .x.  .0.  )  =  ( N  .x.  .0.  )
)
203, 4, 5mulgnn0z 13929 . . . . . 6  |-  ( ( G  e.  Mnd  /\  -u N  e.  NN0 )  ->  ( -u N  .x.  .0.  )  =  .0.  )
212, 20sylan 283 . . . . 5  |-  ( ( ( G  e.  Grp  /\  N  e.  ZZ )  /\  -u N  e.  NN0 )  ->  ( -u N  .x.  .0.  )  =  .0.  )
2221fveq2d 5694 . . . 4  |-  ( ( ( G  e.  Grp  /\  N  e.  ZZ )  /\  -u N  e.  NN0 )  ->  ( ( invg `  G ) `
 ( -u N  .x.  .0.  ) )  =  ( ( invg `  G ) `  .0.  ) )
235, 13grpinvid 13842 . . . . 5  |-  ( G  e.  Grp  ->  (
( invg `  G ) `  .0.  )  =  .0.  )
2423ad2antrr 492 . . . 4  |-  ( ( ( G  e.  Grp  /\  N  e.  ZZ )  /\  -u N  e.  NN0 )  ->  ( ( invg `  G ) `
 .0.  )  =  .0.  )
2522, 24eqtrd 2271 . . 3  |-  ( ( ( G  e.  Grp  /\  N  e.  ZZ )  /\  -u N  e.  NN0 )  ->  ( ( invg `  G ) `
 ( -u N  .x.  .0.  ) )  =  .0.  )
2615, 19, 253eqtr3d 2279 . 2  |-  ( ( ( G  e.  Grp  /\  N  e.  ZZ )  /\  -u N  e.  NN0 )  ->  ( N  .x.  .0.  )  =  .0.  )
27 elznn0 9638 . . . 4  |-  ( N  e.  ZZ  <->  ( N  e.  RR  /\  ( N  e.  NN0  \/  -u N  e.  NN0 ) ) )
2827simprbi 275 . . 3  |-  ( N  e.  ZZ  ->  ( N  e.  NN0  \/  -u N  e.  NN0 ) )
2928adantl 277 . 2  |-  ( ( G  e.  Grp  /\  N  e.  ZZ )  ->  ( N  e.  NN0  \/  -u N  e.  NN0 ) )
307, 26, 29mpjaodan 810 1  |-  ( ( G  e.  Grp  /\  N  e.  ZZ )  ->  ( N  .x.  .0.  )  =  .0.  )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    \/ wo 720    = wceq 1402    e. wcel 2209   ` cfv 5372  (class class class)co 6075   CCcc 8167   RRcr 8168   -ucneg 8488   NN0cn0 9542   ZZcz 9623   Basecbs 13330   0gc0g 13587   Mndcmnd 13706   Grpcgrp 13782   invgcminusg 13783  .gcmg 13899
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-addcom 8269  ax-addass 8271  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-ltadd 8285
This theorem depends on definitions:  df-bi 117  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-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-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-inn 9284  df-2 9342  df-n0 9543  df-z 9624  df-uz 9901  df-fz 10391  df-fzo 10528  df-seqfrec 10863  df-ndx 13333  df-slot 13334  df-base 13336  df-plusg 13421  df-0g 13589  df-mgm 13653  df-sgrp 13694  df-mnd 13707  df-grp 13785  df-minusg 13786  df-mulg 13900
This theorem is referenced by:  mulgmodid  13941
  Copyright terms: Public domain W3C validator