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

Theorem submmulg 13724
Description: A group multiple is the same if evaluated in a submonoid. (Contributed by Mario Carneiro, 15-Jun-2015.)
Hypotheses
Ref Expression
submmulgcl.t  |-  .xb  =  (.g
`  G )
submmulg.h  |-  H  =  ( Gs  S )
submmulg.t  |-  .x.  =  (.g
`  H )
Assertion
Ref Expression
submmulg  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  ( N  .xb  X )  =  ( N  .x.  X
) )

Proof of Theorem submmulg
StepHypRef Expression
1 simpl1 1024 . . . . . 6  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  e.  NN )  ->  S  e.  (SubMnd `  G )
)
2 submmulg.h . . . . . . . 8  |-  H  =  ( Gs  S )
32a1i 9 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  H  =  ( Gs  S ) )
4 eqidd 2230 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  ( +g  `  G )  =  ( +g  `  G ) )
5 id 19 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  S  e.  (SubMnd `  G ) )
6 submrcl 13525 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  G  e.  Mnd )
73, 4, 5, 6ressplusgd 13183 . . . . . 6  |-  ( S  e.  (SubMnd `  G
)  ->  ( +g  `  G )  =  ( +g  `  H ) )
81, 7syl 14 . . . . 5  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  e.  NN )  ->  ( +g  `  G )  =  ( +g  `  H
) )
98seqeq2d 10693 . . . 4  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  e.  NN )  ->  seq 1 ( ( +g  `  G ) ,  ( NN  X.  { X } ) )  =  seq 1 ( ( +g  `  H ) ,  ( NN  X.  { X } ) ) )
109fveq1d 5634 . . 3  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  e.  NN )  ->  (  seq 1 ( ( +g  `  G ) ,  ( NN  X.  { X } ) ) `  N )  =  (  seq 1 ( ( +g  `  H ) ,  ( NN  X.  { X } ) ) `
 N ) )
11 simpr 110 . . . 4  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  e.  NN )  ->  N  e.  NN )
12 eqid 2229 . . . . . . . 8  |-  ( Base `  G )  =  (
Base `  G )
1312submss 13530 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  S  C_  ( Base `  G ) )
14133ad2ant1 1042 . . . . . 6  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  S  C_  ( Base `  G
) )
15 simp3 1023 . . . . . 6  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  X  e.  S )
1614, 15sseldd 3225 . . . . 5  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  X  e.  ( Base `  G
) )
1716adantr 276 . . . 4  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  e.  NN )  ->  X  e.  ( Base `  G
) )
18 eqid 2229 . . . . 5  |-  ( +g  `  G )  =  ( +g  `  G )
19 submmulgcl.t . . . . 5  |-  .xb  =  (.g
`  G )
20 eqid 2229 . . . . 5  |-  seq 1
( ( +g  `  G
) ,  ( NN 
X.  { X }
) )  =  seq 1 ( ( +g  `  G ) ,  ( NN  X.  { X } ) )
2112, 18, 19, 20mulgnn 13684 . . . 4  |-  ( ( N  e.  NN  /\  X  e.  ( Base `  G ) )  -> 
( N  .xb  X
)  =  (  seq 1 ( ( +g  `  G ) ,  ( NN  X.  { X } ) ) `  N ) )
2211, 17, 21syl2anc 411 . . 3  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  e.  NN )  ->  ( N  .xb  X )  =  (  seq 1 ( ( +g  `  G
) ,  ( NN 
X.  { X }
) ) `  N
) )
232submbas 13535 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  S  =  ( Base `  H )
)
24233ad2ant1 1042 . . . . . 6  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  S  =  ( Base `  H
) )
2515, 24eleqtrd 2308 . . . . 5  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  X  e.  ( Base `  H
) )
2625adantr 276 . . . 4  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  e.  NN )  ->  X  e.  ( Base `  H
) )
27 eqid 2229 . . . . 5  |-  ( Base `  H )  =  (
Base `  H )
28 eqid 2229 . . . . 5  |-  ( +g  `  H )  =  ( +g  `  H )
29 submmulg.t . . . . 5  |-  .x.  =  (.g
`  H )
30 eqid 2229 . . . . 5  |-  seq 1
( ( +g  `  H
) ,  ( NN 
X.  { X }
) )  =  seq 1 ( ( +g  `  H ) ,  ( NN  X.  { X } ) )
3127, 28, 29, 30mulgnn 13684 . . . 4  |-  ( ( N  e.  NN  /\  X  e.  ( Base `  H ) )  -> 
( N  .x.  X
)  =  (  seq 1 ( ( +g  `  H ) ,  ( NN  X.  { X } ) ) `  N ) )
3211, 26, 31syl2anc 411 . . 3  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  e.  NN )  ->  ( N  .x.  X )  =  (  seq 1 ( ( +g  `  H
) ,  ( NN 
X.  { X }
) ) `  N
) )
3310, 22, 323eqtr4d 2272 . 2  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  e.  NN )  ->  ( N  .xb  X )  =  ( N  .x.  X
) )
34 simpl1 1024 . . . . 5  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  ->  S  e.  (SubMnd `  G
) )
35 eqid 2229 . . . . . 6  |-  ( 0g
`  G )  =  ( 0g `  G
)
362, 35subm0 13536 . . . . 5  |-  ( S  e.  (SubMnd `  G
)  ->  ( 0g `  G )  =  ( 0g `  H ) )
3734, 36syl 14 . . . 4  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  -> 
( 0g `  G
)  =  ( 0g
`  H ) )
3816adantr 276 . . . . 5  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  ->  X  e.  ( Base `  G ) )
3912, 35, 19mulg0 13683 . . . . 5  |-  ( X  e.  ( Base `  G
)  ->  ( 0 
.xb  X )  =  ( 0g `  G
) )
4038, 39syl 14 . . . 4  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  -> 
( 0  .xb  X
)  =  ( 0g
`  G ) )
4125adantr 276 . . . . 5  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  ->  X  e.  ( Base `  H ) )
42 eqid 2229 . . . . . 6  |-  ( 0g
`  H )  =  ( 0g `  H
)
4327, 42, 29mulg0 13683 . . . . 5  |-  ( X  e.  ( Base `  H
)  ->  ( 0 
.x.  X )  =  ( 0g `  H
) )
4441, 43syl 14 . . . 4  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  -> 
( 0  .x.  X
)  =  ( 0g
`  H ) )
4537, 40, 443eqtr4d 2272 . . 3  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  -> 
( 0  .xb  X
)  =  ( 0 
.x.  X ) )
46 simpr 110 . . . 4  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  ->  N  =  0 )
4746oveq1d 6025 . . 3  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  -> 
( N  .xb  X
)  =  ( 0 
.xb  X ) )
4846oveq1d 6025 . . 3  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  -> 
( N  .x.  X
)  =  ( 0 
.x.  X ) )
4945, 47, 483eqtr4d 2272 . 2  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  -> 
( N  .xb  X
)  =  ( N 
.x.  X ) )
50 simp2 1022 . . 3  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  N  e.  NN0 )
51 elnn0 9387 . . 3  |-  ( N  e.  NN0  <->  ( N  e.  NN  \/  N  =  0 ) )
5250, 51sylib 122 . 2  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  ( N  e.  NN  \/  N  =  0 ) )
5333, 49, 52mpjaodan 803 1  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  ( N  .xb  X )  =  ( N  .x.  X
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    \/ wo 713    /\ w3a 1002    = wceq 1395    e. wcel 2200    C_ wss 3197   {csn 3666    X. cxp 4718   ` cfv 5321  (class class class)co 6010   0cc0 8015   1c1 8016   NNcn 9126   NN0cn0 9385    seqcseq 10686   Basecbs 13053   ↾s cress 13054   +g cplusg 13131   0gc0g 13310   Mndcmnd 13470  SubMndcsubmnd 13512  .gcmg 13677
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 4199  ax-sep 4202  ax-nul 4210  ax-pow 4259  ax-pr 4294  ax-un 4525  ax-setind 4630  ax-iinf 4681  ax-cnex 8106  ax-resscn 8107  ax-1cn 8108  ax-1re 8109  ax-icn 8110  ax-addcl 8111  ax-addrcl 8112  ax-mulcl 8113  ax-addcom 8115  ax-addass 8117  ax-distr 8119  ax-i2m1 8120  ax-0lt1 8121  ax-0id 8123  ax-rnegex 8124  ax-cnre 8126  ax-pre-ltirr 8127  ax-pre-ltwlin 8128  ax-pre-lttrn 8129  ax-pre-ltadd 8131
This theorem depends on definitions:  df-bi 117  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 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4385  df-iord 4458  df-on 4460  df-ilim 4461  df-suc 4463  df-iom 4684  df-xp 4726  df-rel 4727  df-cnv 4728  df-co 4729  df-dm 4730  df-rn 4731  df-res 4732  df-ima 4733  df-iota 5281  df-fun 5323  df-fn 5324  df-f 5325  df-f1 5326  df-fo 5327  df-f1o 5328  df-fv 5329  df-riota 5963  df-ov 6013  df-oprab 6014  df-mpo 6015  df-1st 6295  df-2nd 6296  df-recs 6462  df-frec 6548  df-pnf 8199  df-mnf 8200  df-xr 8201  df-ltxr 8202  df-le 8203  df-sub 8335  df-neg 8336  df-inn 9127  df-2 9185  df-n0 9386  df-z 9463  df-uz 9739  df-seqfrec 10687  df-ndx 13056  df-slot 13057  df-base 13059  df-sets 13060  df-iress 13061  df-plusg 13144  df-0g 13312  df-mgm 13410  df-sgrp 13456  df-mnd 13471  df-submnd 13514  df-minusg 13558  df-mulg 13678
This theorem is referenced by:  lgseisenlem4  15773
  Copyright terms: Public domain W3C validator