Theorem mulgnnp1 13864

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.

Step	Hyp	Ref	Expression
1		simpl 109	. . . . 5 |- ( ( N e. NN /\ X e. B ) -> N e. NN )
2		nnuz 9893	. . . . 5 |- NN = ( ZZ>= ` 1 )
3	1, 2	eleqtrdi 2327	. . . 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 ) )
6	5, 2	eleqtrrdi 2328	. . . . 5 |- ( ( ( N e. NN /\ X e. B ) /\ u e. ( ZZ>= ` 1 ) ) -> u e. NN )
7		fvconst2g 5900	. . . . . . 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 )
9	7, 8	eqeltrd 2311	. . . . . 6 |- ( ( X e. B /\ u e. NN ) -> ( ( NN X. { X } ) ` u ) e. B )
10	9	elexd 2829	. . . . 5 |- ( ( X e. B /\ u e. NN ) -> ( ( NN X. { X } ) ` u ) e. _V )
11	4, 6, 10	syl2anc 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 )
14	13	basmex 13289	. . . . . . 7 |- ( X e. B -> G e. _V )
15		mulgnnp1.p	. . . . . . . 8 |- .+ = ( +g ` G )
16		plusgslid 13342	. . . . . . . . 9 |- ( +g = Slot ( +g ` ndx ) /\ ( +g ` ndx ) e. NN )
17	16	slotex 13256	. . . . . . . 8 |- ( G e. _V -> ( +g ` G ) e. _V )
18	15, 17	eqeltrid 2321	. . . . . . 7 |- ( G e. _V -> .+ e. _V )
19	14, 18	syl 14	. . . . . 6 |- ( X e. B -> .+ e. _V )
20	19	ad2antlr 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 6086	. . . . 5 |- ( ( u e. _V /\ .+ e. _V /\ v e. _V ) -> ( u .+ v ) e. _V )
23	12, 20, 21, 22	syl3anc 1274	. . . 4 |- ( ( ( N e. NN /\ X e. B ) /\ ( u e. _V /\ v e. _V ) ) -> ( u .+ v ) e. _V )
24	3, 11, 23	seq3p1 10831	. . 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 9251	. . . . 5 |- ( N e. NN -> ( N + 1 ) e. NN )
27		fvconst2g 5900	. . . . 5 |- ( ( X e. B /\ ( N + 1 ) e. NN ) -> ( ( NN X. { X } ) ` ( N + 1 ) ) = X )
28	25, 26, 27	syl2anr 290	. . . 4 |- ( ( N e. NN /\ X e. B ) -> ( ( NN X. { X } ) ` ( N + 1 ) ) = X )
29	28	oveq2d 6068	. . 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 ) )
30	24, 29	eqtrd 2267	. 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 2234	. . . 4 |- seq 1 ( .+ , ( NN X. { X } ) ) = seq 1 ( .+ , ( NN X. { X } ) )
33	13, 15, 31, 32	mulgnn 13860	. . 3 |- ( ( ( N + 1 ) e. NN /\ X e. B ) -> ( ( N + 1 ) .x. X ) = ( seq 1 ( .+ , ( NN X. { X } ) ) ` ( N + 1 ) ) )
34	26, 33	sylan 283	. 2 |- ( ( N e. NN /\ X e. B ) -> ( ( N + 1 ) .x. X ) = ( seq 1 ( .+ , ( NN X. { X } ) ) ` ( N + 1 ) ) )
35	13, 15, 31, 32	mulgnn 13860	. . 3 |- ( ( N e. NN /\ X e. B ) -> ( N .x. X ) = ( seq 1 ( .+ , ( NN X. { X } ) ) ` N ) )
36	35	oveq1d 6067	. 2 |- ( ( N e. NN /\ X e. B ) -> ( ( N .x. X ) .+ X ) = ( ( seq 1 ( .+ , ( NN X. { X } ) ) ` N ) .+ X ) )
37	30, 34, 36	3eqtr4d 2277	1 |- ( ( N e. NN /\ X e. B ) -> ( ( N + 1 ) .x. X ) = ( ( N .x. X ) .+ X ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1398   e. wcel 2205   _Vcvv 2815   {csn 3691   X. cxp 4749   ` cfv 5354  (class class class)co 6052   1c1 8130   + caddc 8132   NNcn 9239   ZZ>=cuz 9856   seqcseq 10813   Basecbs 13229   +g cplusg 13307  ._gcmg 13853

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 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-iinf 4712  ax-cnex 8220  ax-resscn 8221  ax-1cn 8222  ax-1re 8223  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-addcom 8229  ax-addass 8231  ax-distr 8233  ax-i2m1 8234  ax-0lt1 8235  ax-0id 8237  ax-rnegex 8238  ax-cnre 8240  ax-pre-ltirr 8241  ax-pre-ltwlin 8242  ax-pre-lttrn 8243  ax-pre-ltadd 8245

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 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-if 3623  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-tr 4211  df-id 4416  df-iord 4489  df-on 4491  df-ilim 4492  df-suc 4494  df-iom 4715  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-recs 6538  df-frec 6624  df-pnf 8312  df-mnf 8313  df-xr 8314  df-ltxr 8315  df-le 8316  df-sub 8448  df-neg 8449  df-inn 9240  df-2 9298  df-n0 9499  df-z 9580  df-uz 9857  df-seqfrec 10814  df-ndx 13232  df-slot 13233  df-base 13235  df-plusg 13320  df-0g 13488  df-minusg 13734  df-mulg 13854

This theorem is referenced by:  mulg2  13865  mulgnn0p1  13867  mulgnnass  13891  gsumfzconst  14075