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

Theorem submmulg 13816
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 1027 . . . . . 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 2232 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  ( +g  `  G )  =  ( +g  `  G ) )
5 id 19 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  S  e.  (SubMnd `  G ) )
6 submrcl 13617 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  G  e.  Mnd )
73, 4, 5, 6ressplusgd 13275 . . . . . 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 10762 . . . 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 5650 . . 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 2231 . . . . . . . 8  |-  ( Base `  G )  =  (
Base `  G )
1312submss 13622 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  S  C_  ( Base `  G ) )
14133ad2ant1 1045 . . . . . 6  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  S  C_  ( Base `  G
) )
15 simp3 1026 . . . . . 6  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  X  e.  S )
1614, 15sseldd 3229 . . . . 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 2231 . . . . 5  |-  ( +g  `  G )  =  ( +g  `  G )
19 submmulgcl.t . . . . 5  |-  .xb  =  (.g
`  G )
20 eqid 2231 . . . . 5  |-  seq 1
( ( +g  `  G
) ,  ( NN 
X.  { X }
) )  =  seq 1 ( ( +g  `  G ) ,  ( NN  X.  { X } ) )
2112, 18, 19, 20mulgnn 13776 . . . 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 13627 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  S  =  ( Base `  H )
)
24233ad2ant1 1045 . . . . . 6  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  S  =  ( Base `  H
) )
2515, 24eleqtrd 2310 . . . . 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 2231 . . . . 5  |-  ( Base `  H )  =  (
Base `  H )
28 eqid 2231 . . . . 5  |-  ( +g  `  H )  =  ( +g  `  H )
29 submmulg.t . . . . 5  |-  .x.  =  (.g
`  H )
30 eqid 2231 . . . . 5  |-  seq 1
( ( +g  `  H
) ,  ( NN 
X.  { X }
) )  =  seq 1 ( ( +g  `  H ) ,  ( NN  X.  { X } ) )
3127, 28, 29, 30mulgnn 13776 . . . 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 2274 . 2  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  e.  NN )  ->  ( N  .xb  X )  =  ( N  .x.  X
) )
34 simpl1 1027 . . . . 5  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  ->  S  e.  (SubMnd `  G
) )
35 eqid 2231 . . . . . 6  |-  ( 0g
`  G )  =  ( 0g `  G
)
362, 35subm0 13628 . . . . 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 13775 . . . . 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 2231 . . . . . 6  |-  ( 0g
`  H )  =  ( 0g `  H
)
4327, 42, 29mulg0 13775 . . . . 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 2274 . . 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 6043 . . 3  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  -> 
( N  .xb  X
)  =  ( 0 
.xb  X ) )
4846oveq1d 6043 . . 3  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  -> 
( N  .x.  X
)  =  ( 0 
.x.  X ) )
4945, 47, 483eqtr4d 2274 . 2  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  -> 
( N  .xb  X
)  =  ( N 
.x.  X ) )
50 simp2 1025 . . 3  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  N  e.  NN0 )
51 elnn0 9446 . . 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 806 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 716    /\ w3a 1005    = wceq 1398    e. wcel 2202    C_ wss 3201   {csn 3673    X. cxp 4729   ` cfv 5333  (class class class)co 6028   0cc0 8075   1c1 8076   NNcn 9185   NN0cn0 9444    seqcseq 10755   Basecbs 13145   ↾s cress 13146   +g cplusg 13223   0gc0g 13402   Mndcmnd 13562  SubMndcsubmnd 13604  .gcmg 13769
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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-addass 8177  ax-distr 8179  ax-i2m1 8180  ax-0lt1 8181  ax-0id 8183  ax-rnegex 8184  ax-cnre 8186  ax-pre-ltirr 8187  ax-pre-ltwlin 8188  ax-pre-lttrn 8189  ax-pre-ltadd 8191
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-ilim 4472  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-frec 6600  df-pnf 8258  df-mnf 8259  df-xr 8260  df-ltxr 8261  df-le 8262  df-sub 8394  df-neg 8395  df-inn 9186  df-2 9244  df-n0 9445  df-z 9524  df-uz 9800  df-seqfrec 10756  df-ndx 13148  df-slot 13149  df-base 13151  df-sets 13152  df-iress 13153  df-plusg 13236  df-0g 13404  df-mgm 13502  df-sgrp 13548  df-mnd 13563  df-submnd 13606  df-minusg 13650  df-mulg 13770
This theorem is referenced by:  lgseisenlem4  15875
  Copyright terms: Public domain W3C validator