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

Theorem submmulg 13374
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 1002 . . . . . 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 2197 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  ( +g  `  G )  =  ( +g  `  G ) )
5 id 19 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  S  e.  (SubMnd `  G ) )
6 submrcl 13175 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  G  e.  Mnd )
73, 4, 5, 6ressplusgd 12833 . . . . . 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 10565 . . . 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 5563 . . 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 2196 . . . . . . . 8  |-  ( Base `  G )  =  (
Base `  G )
1312submss 13180 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  S  C_  ( Base `  G ) )
14133ad2ant1 1020 . . . . . 6  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  S  C_  ( Base `  G
) )
15 simp3 1001 . . . . . 6  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  X  e.  S )
1614, 15sseldd 3185 . . . . 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 2196 . . . . 5  |-  ( +g  `  G )  =  ( +g  `  G )
19 submmulgcl.t . . . . 5  |-  .xb  =  (.g
`  G )
20 eqid 2196 . . . . 5  |-  seq 1
( ( +g  `  G
) ,  ( NN 
X.  { X }
) )  =  seq 1 ( ( +g  `  G ) ,  ( NN  X.  { X } ) )
2112, 18, 19, 20mulgnn 13334 . . . 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 13185 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  S  =  ( Base `  H )
)
24233ad2ant1 1020 . . . . . 6  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  S  =  ( Base `  H
) )
2515, 24eleqtrd 2275 . . . . 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 2196 . . . . 5  |-  ( Base `  H )  =  (
Base `  H )
28 eqid 2196 . . . . 5  |-  ( +g  `  H )  =  ( +g  `  H )
29 submmulg.t . . . . 5  |-  .x.  =  (.g
`  H )
30 eqid 2196 . . . . 5  |-  seq 1
( ( +g  `  H
) ,  ( NN 
X.  { X }
) )  =  seq 1 ( ( +g  `  H ) ,  ( NN  X.  { X } ) )
3127, 28, 29, 30mulgnn 13334 . . . 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 2239 . 2  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  e.  NN )  ->  ( N  .xb  X )  =  ( N  .x.  X
) )
34 simpl1 1002 . . . . 5  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  ->  S  e.  (SubMnd `  G
) )
35 eqid 2196 . . . . . 6  |-  ( 0g
`  G )  =  ( 0g `  G
)
362, 35subm0 13186 . . . . 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 13333 . . . . 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 2196 . . . . . 6  |-  ( 0g
`  H )  =  ( 0g `  H
)
4327, 42, 29mulg0 13333 . . . . 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 2239 . . 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 5940 . . 3  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  -> 
( N  .xb  X
)  =  ( 0 
.xb  X ) )
4846oveq1d 5940 . . 3  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  -> 
( N  .x.  X
)  =  ( 0 
.x.  X ) )
4945, 47, 483eqtr4d 2239 . 2  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  -> 
( N  .xb  X
)  =  ( N 
.x.  X ) )
50 simp2 1000 . . 3  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  N  e.  NN0 )
51 elnn0 9270 . . 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 799 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 709    /\ w3a 980    = wceq 1364    e. wcel 2167    C_ wss 3157   {csn 3623    X. cxp 4662   ` cfv 5259  (class class class)co 5925   0cc0 7898   1c1 7899   NNcn 9009   NN0cn0 9268    seqcseq 10558   Basecbs 12705   ↾s cress 12706   +g cplusg 12782   0gc0g 12960   Mndcmnd 13120  SubMndcsubmnd 13162  .gcmg 13327
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625  ax-cnex 7989  ax-resscn 7990  ax-1cn 7991  ax-1re 7992  ax-icn 7993  ax-addcl 7994  ax-addrcl 7995  ax-mulcl 7996  ax-addcom 7998  ax-addass 8000  ax-distr 8002  ax-i2m1 8003  ax-0lt1 8004  ax-0id 8006  ax-rnegex 8007  ax-cnre 8009  ax-pre-ltirr 8010  ax-pre-ltwlin 8011  ax-pre-lttrn 8012  ax-pre-ltadd 8014
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-if 3563  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-id 4329  df-iord 4402  df-on 4404  df-ilim 4405  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-recs 6372  df-frec 6458  df-pnf 8082  df-mnf 8083  df-xr 8084  df-ltxr 8085  df-le 8086  df-sub 8218  df-neg 8219  df-inn 9010  df-2 9068  df-n0 9269  df-z 9346  df-uz 9621  df-seqfrec 10559  df-ndx 12708  df-slot 12709  df-base 12711  df-sets 12712  df-iress 12713  df-plusg 12795  df-0g 12962  df-mgm 13060  df-sgrp 13106  df-mnd 13121  df-submnd 13164  df-minusg 13208  df-mulg 13328
This theorem is referenced by:  lgseisenlem4  15422
  Copyright terms: Public domain W3C validator