Theorem mulgnnp1 13992

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 9974	. . . . 5 |- NN = ( ZZ>= ` 1 )
3	1, 2	eleqtrdi 2331	. . . 4 |- ( ( N e. NN /\ X e. B ) -> N e. ( ZZ>= ` 1 ) )
4		simplr 533	. . . . 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 2332	. . . . 5 |- ( ( ( N e. NN /\ X e. B ) /\ u e. ( ZZ>= ` 1 ) ) -> u e. NN )
7		fvconst2g 5932	. . . . . . 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 2315	. . . . . 6 |- ( ( X e. B /\ u e. NN ) -> ( ( NN X. { X } ) ` u ) e. B )
10	9	elexd 2835	. . . . 5 |- ( ( X e. B /\ u e. NN ) -> ( ( NN X. { X } ) ` u ) e. _V )
11	4, 6, 10	syl2anc 415	. . . 4 |- ( ( ( N e. NN /\ X e. B ) /\ u e. ( ZZ>= ` 1 ) ) -> ( ( NN X. { X } ) ` u ) e. _V )
12		simprl 535	. . . . 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 13470	. . . . . . 7 |- ( X e. B -> G e. _V )
15		mulgnnp1.p	. . . . . . . 8 |- .+ = ( +g ` G )
16		plusgslid 13525	. . . . . . . . 9 |- ( +g = Slot ( +g ` ndx ) /\ ( +g ` ndx ) e. NN )
17	16	slotex 13437	. . . . . . . 8 |- ( G e. _V -> ( +g ` G ) e. _V )
18	15, 17	eqeltrid 2325	. . . . . . 7 |- ( G e. _V -> .+ e. _V )
19	14, 18	syl 14	. . . . . 6 |- ( X e. B -> .+ e. _V )
20	19	ad2antlr 493	. . . . 5 |- ( ( ( N e. NN /\ X e. B ) /\ ( u e. _V /\ v e. _V ) ) -> .+ e. _V )
21		simprr 537	. . . . 5 |- ( ( ( N e. NN /\ X e. B ) /\ ( u e. _V /\ v e. _V ) ) -> v e. _V )
22		ovexg 6122	. . . . 5 |- ( ( u e. _V /\ .+ e. _V /\ v e. _V ) -> ( u .+ v ) e. _V )
23	12, 20, 21, 22	syl3anc 1278	. . . 4 |- ( ( ( N e. NN /\ X e. B ) /\ ( u e. _V /\ v e. _V ) ) -> ( u .+ v ) e. _V )
24	3, 11, 23	seq3p1 10923	. . 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 9325	. . . . 5 |- ( N e. NN -> ( N + 1 ) e. NN )
27		fvconst2g 5932	. . . . 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 6104	. . 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 2271	. 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 2238	. . . 4 |- seq 1 ( .+ , ( NN X. { X } ) ) = seq 1 ( .+ , ( NN X. { X } ) )
33	13, 15, 31, 32	mulgnn 13988	. . 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 13988	. . 3 |- ( ( N e. NN /\ X e. B ) -> ( N .x. X ) = ( seq 1 ( .+ , ( NN X. { X } ) ) ` N ) )
36	35	oveq1d 6103	. 2 |- ( ( N e. NN /\ X e. B ) -> ( ( N .x. X ) .+ X ) = ( ( seq 1 ( .+ , ( NN X. { X } ) ) ` N ) .+ X ) )
37	30, 34, 36	3eqtr4d 2281	1 |- ( ( N e. NN /\ X e. B ) -> ( ( N + 1 ) .x. X ) = ( ( N .x. X ) .+ X ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   _Vcvv 2821   {csn 3709   X. cxp 4774   ` cfv 5380  (class class class)co 6088   1c1 8186   + caddc 8188   NNcn 9313   ZZ>=cuz 9937   seqcseq 10905   Basecbs 13410   +g cplusg 13490  ._gcmg 13981

This proof depends on 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 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-ltadd 8301

This proof 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-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 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-frec 6666  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-inn 9314  df-2 9372  df-n0 9575  df-z 9656  df-uz 9938  df-seqfrec 10906  df-ndx 13413  df-slot 13414  df-base 13416  df-plusg 13503  df-0g 13671  df-minusg 13868  df-mulg 13982

This theorem is used by:  mulg2  13993  mulgnn0p1  13995  mulgnnass  14019  gzsumconst  14233