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

Theorem submmulg 13946
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 1031 . . . . . 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 2239 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  ( +g  `  G )  =  ( +g  `  G ) )
5 id 19 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  S  e.  (SubMnd `  G ) )
6 submrcl 13755 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  G  e.  Mnd )
73, 4, 5, 6ressplusgd 13460 . . . . . 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 10869 . . . 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 5692 . . 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 2238 . . . . . . . 8  |-  ( Base `  G )  =  (
Base `  G )
1312submss 13760 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  S  C_  ( Base `  G ) )
14133ad2ant1 1049 . . . . . 6  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  S  C_  ( Base `  G
) )
15 simp3 1030 . . . . . 6  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  X  e.  S )
1614, 15sseldd 3249 . . . . 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 2238 . . . . 5  |-  ( +g  `  G )  =  ( +g  `  G )
19 submmulgcl.t . . . . 5  |-  .xb  =  (.g
`  G )
20 eqid 2238 . . . . 5  |-  seq 1
( ( +g  `  G
) ,  ( NN 
X.  { X }
) )  =  seq 1 ( ( +g  `  G ) ,  ( NN  X.  { X } ) )
2112, 18, 19, 20mulgnn 13906 . . . 4  |-  ( ( N  e.  NN  /\  X  e.  ( Base `  G ) )  -> 
( N  .xb  X
)  =  (  seq 1 ( ( +g  `  G ) ,  ( NN  X.  { X } ) ) `  N ) )
2211, 17, 21syl2anc 415 . . 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 13765 . . . . . . 7  |-  ( S  e.  (SubMnd `  G
)  ->  S  =  ( Base `  H )
)
24233ad2ant1 1049 . . . . . 6  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  S  =  ( Base `  H
) )
2515, 24eleqtrd 2317 . . . . 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 2238 . . . . 5  |-  ( Base `  H )  =  (
Base `  H )
28 eqid 2238 . . . . 5  |-  ( +g  `  H )  =  ( +g  `  H )
29 submmulg.t . . . . 5  |-  .x.  =  (.g
`  H )
30 eqid 2238 . . . . 5  |-  seq 1
( ( +g  `  H
) ,  ( NN 
X.  { X }
) )  =  seq 1 ( ( +g  `  H ) ,  ( NN  X.  { X } ) )
3127, 28, 29, 30mulgnn 13906 . . . 4  |-  ( ( N  e.  NN  /\  X  e.  ( Base `  H ) )  -> 
( N  .x.  X
)  =  (  seq 1 ( ( +g  `  H ) ,  ( NN  X.  { X } ) ) `  N ) )
3211, 26, 31syl2anc 415 . . 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 2281 . 2  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  e.  NN )  ->  ( N  .xb  X )  =  ( N  .x.  X
) )
34 simpl1 1031 . . . . 5  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  ->  S  e.  (SubMnd `  G
) )
35 eqid 2238 . . . . . 6  |-  ( 0g
`  G )  =  ( 0g `  G
)
362, 35subm0 13766 . . . . 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 13905 . . . . 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 2238 . . . . . 6  |-  ( 0g
`  H )  =  ( 0g `  H
)
4327, 42, 29mulg0 13905 . . . . 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 2281 . . 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 6090 . . 3  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  -> 
( N  .xb  X
)  =  ( 0 
.xb  X ) )
4846oveq1d 6090 . . 3  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  -> 
( N  .x.  X
)  =  ( 0 
.x.  X ) )
4945, 47, 483eqtr4d 2281 . 2  |-  ( ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  /\  N  =  0 )  -> 
( N  .xb  X
)  =  ( N 
.x.  X ) )
50 simp2 1029 . . 3  |-  ( ( S  e.  (SubMnd `  G )  /\  N  e.  NN0  /\  X  e.  S )  ->  N  e.  NN0 )
51 elnn0 9544 . . 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 810 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 720    /\ w3a 1009    = wceq 1402    e. wcel 2209    C_ wss 3220   {csn 3705    X. cxp 4767   ` cfv 5372  (class class class)co 6075   0cc0 8169   1c1 8170   NNcn 9283   NN0cn0 9542    seqcseq 10862   Basecbs 13330   ↾s cress 13331   +g cplusg 13408   0gc0g 13587   Mndcmnd 13706  SubMndcsubmnd 13742  .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-seqfrec 10863  df-ndx 13333  df-slot 13334  df-base 13336  df-sets 13337  df-iress 13338  df-plusg 13421  df-0g 13589  df-mgm 13653  df-sgrp 13694  df-mnd 13707  df-submnd 13744  df-minusg 13786  df-mulg 13900
This theorem is referenced by:  lgseisenlem4  16106
  Copyright terms: Public domain W3C validator