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

Theorem mulgnnp1 13716
Description: Group multiple (exponentiation) operation at a successor. (Contributed by Mario Carneiro, 11-Dec-2014.)
Hypotheses
Ref Expression
mulg1.b  |-  B  =  ( Base `  G
)
mulg1.m  |-  .x.  =  (.g
`  G )
mulgnnp1.p  |-  .+  =  ( +g  `  G )
Assertion
Ref Expression
mulgnnp1  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  ( ( N  + 
1 )  .x.  X
)  =  ( ( N  .x.  X ) 
.+  X ) )

Proof of Theorem mulgnnp1
Dummy variables  u  v are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpl 109 . . . . 5  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  N  e.  NN )
2 nnuz 9791 . . . . 5  |-  NN  =  ( ZZ>= `  1 )
31, 2eleqtrdi 2324 . . . 4  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  N  e.  ( ZZ>= ` 
1 ) )
4 simplr 529 . . . . 5  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  u  e.  (
ZZ>= `  1 ) )  ->  X  e.  B
)
5 simpr 110 . . . . . 6  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  u  e.  (
ZZ>= `  1 ) )  ->  u  e.  (
ZZ>= `  1 ) )
65, 2eleqtrrdi 2325 . . . . 5  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  u  e.  (
ZZ>= `  1 ) )  ->  u  e.  NN )
7 fvconst2g 5867 . . . . . . 7  |-  ( ( X  e.  B  /\  u  e.  NN )  ->  ( ( NN  X.  { X } ) `  u )  =  X )
8 simpl 109 . . . . . . 7  |-  ( ( X  e.  B  /\  u  e.  NN )  ->  X  e.  B )
97, 8eqeltrd 2308 . . . . . 6  |-  ( ( X  e.  B  /\  u  e.  NN )  ->  ( ( NN  X.  { X } ) `  u )  e.  B
)
109elexd 2816 . . . . 5  |-  ( ( X  e.  B  /\  u  e.  NN )  ->  ( ( NN  X.  { X } ) `  u )  e.  _V )
114, 6, 10syl2anc 411 . . . 4  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  u  e.  (
ZZ>= `  1 ) )  ->  ( ( NN 
X.  { X }
) `  u )  e.  _V )
12 simprl 531 . . . . 5  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  ( u  e. 
_V  /\  v  e.  _V ) )  ->  u  e.  _V )
13 mulg1.b . . . . . . . 8  |-  B  =  ( Base `  G
)
1413basmex 13141 . . . . . . 7  |-  ( X  e.  B  ->  G  e.  _V )
15 mulgnnp1.p . . . . . . . 8  |-  .+  =  ( +g  `  G )
16 plusgslid 13194 . . . . . . . . 9  |-  ( +g  = Slot  ( +g  `  ndx )  /\  ( +g  `  ndx )  e.  NN )
1716slotex 13108 . . . . . . . 8  |-  ( G  e.  _V  ->  ( +g  `  G )  e. 
_V )
1815, 17eqeltrid 2318 . . . . . . 7  |-  ( G  e.  _V  ->  .+  e.  _V )
1914, 18syl 14 . . . . . 6  |-  ( X  e.  B  ->  .+  e.  _V )
2019ad2antlr 489 . . . . 5  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  ( u  e. 
_V  /\  v  e.  _V ) )  ->  .+  e.  _V )
21 simprr 533 . . . . 5  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  ( u  e. 
_V  /\  v  e.  _V ) )  ->  v  e.  _V )
22 ovexg 6051 . . . . 5  |-  ( ( u  e.  _V  /\  .+  e.  _V  /\  v  e.  _V )  ->  (
u  .+  v )  e.  _V )
2312, 20, 21, 22syl3anc 1273 . . . 4  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  ( u  e. 
_V  /\  v  e.  _V ) )  ->  (
u  .+  v )  e.  _V )
243, 11, 23seq3p1 10726 . . 3  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  (  seq 1 ( 
.+  ,  ( NN 
X.  { X }
) ) `  ( N  +  1 ) )  =  ( (  seq 1 (  .+  ,  ( NN  X.  { X } ) ) `
 N )  .+  ( ( NN  X.  { X } ) `  ( N  +  1
) ) ) )
25 id 19 . . . . 5  |-  ( X  e.  B  ->  X  e.  B )
26 peano2nn 9154 . . . . 5  |-  ( N  e.  NN  ->  ( N  +  1 )  e.  NN )
27 fvconst2g 5867 . . . . 5  |-  ( ( X  e.  B  /\  ( N  +  1
)  e.  NN )  ->  ( ( NN 
X.  { X }
) `  ( N  +  1 ) )  =  X )
2825, 26, 27syl2anr 290 . . . 4  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  ( ( NN  X.  { X } ) `  ( N  +  1
) )  =  X )
2928oveq2d 6033 . . 3  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  ( (  seq 1
(  .+  ,  ( NN  X.  { X }
) ) `  N
)  .+  ( ( NN  X.  { X }
) `  ( N  +  1 ) ) )  =  ( (  seq 1 (  .+  ,  ( NN  X.  { X } ) ) `
 N )  .+  X ) )
3024, 29eqtrd 2264 . 2  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  (  seq 1 ( 
.+  ,  ( NN 
X.  { X }
) ) `  ( N  +  1 ) )  =  ( (  seq 1 (  .+  ,  ( NN  X.  { X } ) ) `
 N )  .+  X ) )
31 mulg1.m . . . 4  |-  .x.  =  (.g
`  G )
32 eqid 2231 . . . 4  |-  seq 1
(  .+  ,  ( NN  X.  { X }
) )  =  seq 1 (  .+  , 
( NN  X.  { X } ) )
3313, 15, 31, 32mulgnn 13712 . . 3  |-  ( ( ( N  +  1 )  e.  NN  /\  X  e.  B )  ->  ( ( N  + 
1 )  .x.  X
)  =  (  seq 1 (  .+  , 
( NN  X.  { X } ) ) `  ( N  +  1
) ) )
3426, 33sylan 283 . 2  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  ( ( N  + 
1 )  .x.  X
)  =  (  seq 1 (  .+  , 
( NN  X.  { X } ) ) `  ( N  +  1
) ) )
3513, 15, 31, 32mulgnn 13712 . . 3  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  ( N  .x.  X
)  =  (  seq 1 (  .+  , 
( NN  X.  { X } ) ) `  N ) )
3635oveq1d 6032 . 2  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  ( ( N  .x.  X )  .+  X
)  =  ( (  seq 1 (  .+  ,  ( NN  X.  { X } ) ) `
 N )  .+  X ) )
3730, 34, 363eqtr4d 2274 1  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  ( ( N  + 
1 )  .x.  X
)  =  ( ( N  .x.  X ) 
.+  X ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1397    e. wcel 2202   _Vcvv 2802   {csn 3669    X. cxp 4723   ` cfv 5326  (class class class)co 6017   1c1 8032    + caddc 8034   NNcn 9142   ZZ>=cuz 9754    seqcseq 10708   Basecbs 13081   +g cplusg 13159  .gcmg 13705
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-ltadd 8147
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-frec 6556  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-inn 9143  df-2 9201  df-n0 9402  df-z 9479  df-uz 9755  df-seqfrec 10709  df-ndx 13084  df-slot 13085  df-base 13087  df-plusg 13172  df-0g 13340  df-minusg 13586  df-mulg 13706
This theorem is referenced by:  mulg2  13717  mulgnn0p1  13719  mulgnnass  13743  gsumfzconst  13927
  Copyright terms: Public domain W3C validator