Theorem mulgfvalg 13788

Description: Group multiple (exponentiation) operation. (Contributed by Mario Carneiro, 11-Dec-2014.)

Hypotheses

Ref	Expression
mulgval.b	|- B = ( Base ` G )
mulgval.p	|- .+ = ( +g ` G )
mulgval.o	|- .0. = ( 0g ` G )
mulgval.i	|- I = ( invg ` G )
mulgval.t	|- .x. = (.g ` G )

Assertion

Ref	Expression
mulgfvalg	|- ( G e. V -> .x. = ( n e. ZZ , x e. B |-> if ( n = 0 , .0. , if ( 0 < n , ( seq 1 ( .+ , ( NN X. { x } ) ) ` n ) , ( I ` ( seq 1 ( .+ , ( NN X. { x } ) ) ` -u n ) ) ) ) ) )

Distinct variable groups:   x, .0. , n   x, B, n   x, .+ , n   x, G, n   x, I, n

Allowed substitution hints:   .x. ( x, n)   V( x, n)

Proof of Theorem mulgfvalg

Dummy variables w s are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mulgval.t	. 2 |- .x. = (.g ` G )
2		df-mulg 13787	. . 3 |- .g = ( w e. _V |-> ( n e. ZZ , x e. ( Base ` w ) |-> if ( n = 0 , ( 0g ` w ) , [_ seq 1 ( ( +g ` w ) , ( NN X. { x } ) ) / s ]_ if ( 0 < n , ( s ` n ) , ( ( invg ` w ) ` ( s ` -u n ) ) ) ) ) )
3		eqidd 2232	. . . 4 |- ( w = G -> ZZ = ZZ )
4		fveq2 5648	. . . . 5 |- ( w = G -> ( Base ` w ) = ( Base ` G ) )
5		mulgval.b	. . . . 5 |- B = ( Base ` G )
6	4, 5	eqtr4di 2282	. . . 4 |- ( w = G -> ( Base ` w ) = B )
7		fveq2 5648	. . . . . 6 |- ( w = G -> ( 0g ` w ) = ( 0g ` G ) )
8		mulgval.o	. . . . . 6 |- .0. = ( 0g ` G )
9	7, 8	eqtr4di 2282	. . . . 5 |- ( w = G -> ( 0g ` w ) = .0. )
10		seqex 10774	. . . . . . 7 |- seq 1 ( ( +g ` w ) , ( NN X. { x } ) ) e. _V
11	10	a1i 9	. . . . . 6 |- ( w = G -> seq 1 ( ( +g ` w ) , ( NN X. { x } ) ) e. _V )
12		id 19	. . . . . . . . 9 |- ( s = seq 1 ( ( +g ` w ) , ( NN X. { x } ) ) -> s = seq 1 ( ( +g ` w ) , ( NN X. { x } ) ) )
13		fveq2 5648	. . . . . . . . . . 11 |- ( w = G -> ( +g ` w ) = ( +g ` G ) )
14		mulgval.p	. . . . . . . . . . 11 |- .+ = ( +g ` G )
15	13, 14	eqtr4di 2282	. . . . . . . . . 10 |- ( w = G -> ( +g ` w ) = .+ )
16	15	seqeq2d 10779	. . . . . . . . 9 |- ( w = G -> seq 1 ( ( +g ` w ) , ( NN X. { x } ) ) = seq 1 ( .+ , ( NN X. { x } ) ) )
17	12, 16	sylan9eqr 2286	. . . . . . . 8 |- ( ( w = G /\ s = seq 1 ( ( +g ` w ) , ( NN X. { x } ) ) ) -> s = seq 1 ( .+ , ( NN X. { x } ) ) )
18	17	fveq1d 5650	. . . . . . 7 |- ( ( w = G /\ s = seq 1 ( ( +g ` w ) , ( NN X. { x } ) ) ) -> ( s ` n ) = ( seq 1 ( .+ , ( NN X. { x } ) ) ` n ) )
19		simpl 109	. . . . . . . . . 10 |- ( ( w = G /\ s = seq 1 ( ( +g ` w ) , ( NN X. { x } ) ) ) -> w = G )
20	19	fveq2d 5652	. . . . . . . . 9 |- ( ( w = G /\ s = seq 1 ( ( +g ` w ) , ( NN X. { x } ) ) ) -> ( invg ` w ) = ( invg ` G ) )
21		mulgval.i	. . . . . . . . 9 |- I = ( invg ` G )
22	20, 21	eqtr4di 2282	. . . . . . . 8 |- ( ( w = G /\ s = seq 1 ( ( +g ` w ) , ( NN X. { x } ) ) ) -> ( invg ` w ) = I )
23	17	fveq1d 5650	. . . . . . . 8 |- ( ( w = G /\ s = seq 1 ( ( +g ` w ) , ( NN X. { x } ) ) ) -> ( s ` -u n ) = ( seq 1 ( .+ , ( NN X. { x } ) ) ` -u n ) )
24	22, 23	fveq12d 5655	. . . . . . 7 |- ( ( w = G /\ s = seq 1 ( ( +g ` w ) , ( NN X. { x } ) ) ) -> ( ( invg ` w ) ` ( s ` -u n ) ) = ( I ` ( seq 1 ( .+ , ( NN X. { x } ) ) ` -u n ) ) )
25	18, 24	ifeq12d 3629	. . . . . 6 |- ( ( w = G /\ s = seq 1 ( ( +g ` w ) , ( NN X. { x } ) ) ) -> if ( 0 < n , ( s ` n ) , ( ( invg ` w ) ` ( s ` -u n ) ) ) = if ( 0 < n , ( seq 1 ( .+ , ( NN X. { x } ) ) ` n ) , ( I ` ( seq 1 ( .+ , ( NN X. { x } ) ) ` -u n ) ) ) )
26	11, 25	csbied 3175	. . . . 5 |- ( w = G -> [_ seq 1 ( ( +g ` w ) , ( NN X. { x } ) ) / s ]_ if ( 0 < n , ( s ` n ) , ( ( invg ` w ) ` ( s ` -u n ) ) ) = if ( 0 < n , ( seq 1 ( .+ , ( NN X. { x } ) ) ` n ) , ( I ` ( seq 1 ( .+ , ( NN X. { x } ) ) ` -u n ) ) ) )
27	9, 26	ifeq12d 3629	. . . 4 |- ( w = G -> if ( n = 0 , ( 0g ` w ) , [_ seq 1 ( ( +g ` w ) , ( NN X. { x } ) ) / s ]_ if ( 0 < n , ( s ` n ) , ( ( invg ` w ) ` ( s ` -u n ) ) ) ) = if ( n = 0 , .0. , if ( 0 < n , ( seq 1 ( .+ , ( NN X. { x } ) ) ` n ) , ( I ` ( seq 1 ( .+ , ( NN X. { x } ) ) ` -u n ) ) ) ) )
28	3, 6, 27	mpoeq123dv 6093	. . 3 |- ( w = G -> ( n e. ZZ , x e. ( Base ` w ) |-> if ( n = 0 , ( 0g ` w ) , [_ seq 1 ( ( +g ` w ) , ( NN X. { x } ) ) / s ]_ if ( 0 < n , ( s ` n ) , ( ( invg ` w ) ` ( s ` -u n ) ) ) ) ) = ( n e. ZZ , x e. B |-> if ( n = 0 , .0. , if ( 0 < n , ( seq 1 ( .+ , ( NN X. { x } ) ) ` n ) , ( I ` ( seq 1 ( .+ , ( NN X. { x } ) ) ` -u n ) ) ) ) ) )
29		elex 2815	. . 3 |- ( G e. V -> G e. _V )
30		zex 9549	. . . 4 |- ZZ e. _V
31		basfn 13221	. . . . . 6 |- Base Fn _V
32		funfvex 5665	. . . . . . 7 |- ( ( Fun Base /\ G e. dom Base ) -> ( Base ` G ) e. _V )
33	32	funfni 5439	. . . . . 6 |- ( ( Base Fn _V /\ G e. _V ) -> ( Base ` G ) e. _V )
34	31, 29, 33	sylancr 414	. . . . 5 |- ( G e. V -> ( Base ` G ) e. _V )
35	5, 34	eqeltrid 2318	. . . 4 |- ( G e. V -> B e. _V )
36		mpoexga 6386	. . . 4 |- ( ( ZZ e. _V /\ B e. _V ) -> ( n e. ZZ , x e. B |-> if ( n = 0 , .0. , if ( 0 < n , ( seq 1 ( .+ , ( NN X. { x } ) ) ` n ) , ( I ` ( seq 1 ( .+ , ( NN X. { x } ) ) ` -u n ) ) ) ) ) e. _V )
37	30, 35, 36	sylancr 414	. . 3 |- ( G e. V -> ( n e. ZZ , x e. B |-> if ( n = 0 , .0. , if ( 0 < n , ( seq 1 ( .+ , ( NN X. { x } ) ) ` n ) , ( I ` ( seq 1 ( .+ , ( NN X. { x } ) ) ` -u n ) ) ) ) ) e. _V )
38	2, 28, 29, 37	fvmptd3 5749	. 2 |- ( G e. V -> (.g ` G ) = ( n e. ZZ , x e. B |-> if ( n = 0 , .0. , if ( 0 < n , ( seq 1 ( .+ , ( NN X. { x } ) ) ` n ) , ( I ` ( seq 1 ( .+ , ( NN X. { x } ) ) ` -u n ) ) ) ) ) )
39	1, 38	eqtrid 2276	1 |- ( G e. V -> .x. = ( n e. ZZ , x e. B |-> if ( n = 0 , .0. , if ( 0 < n , ( seq 1 ( .+ , ( NN X. { x } ) ) ` n ) , ( I ` ( seq 1 ( .+ , ( NN X. { x } ) ) ` -u n ) ) ) ) ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1398   e. wcel 2202   _Vcvv 2803   [_csb 3128   ifcif 3607   {csn 3673   class class class wbr 4093   X. cxp 4729   Fn wfn 5328   ` cfv 5333   e. cmpo 6030   0cc0 8092   1c1 8093   < clt 8273   -ucneg 8410   NNcn 9202   ZZcz 9540   seqcseq 10772   Basecbs 13162   +g cplusg 13240   0gc0g 13419   invgcminusg 13664  ._gcmg 13786

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-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-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692  ax-cnex 8183  ax-resscn 8184  ax-1re 8186  ax-addrcl 8189

This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  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-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-un 3205  df-in 3207  df-ss 3214  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-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-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-frec 6600  df-neg 8412  df-inn 9203  df-z 9541  df-seqfrec 10773  df-ndx 13165  df-slot 13166  df-base 13168  df-mulg 13787

This theorem is referenced by:  mulgval  13789  mulgex  13790  mulgfng  13791  mulgpropdg  13831