Theorem plusffvalg 13682

Description: The group addition operation as a function. (Contributed by Mario Carneiro, 14-Aug-2015.) (Proof shortened by AV, 2-Mar-2024.)

Hypotheses

Ref	Expression
plusffval.1	|- B = ( Base ` G )
plusffval.2	|- .+ = ( +g ` G )
plusffval.3	|- .+^ = ( +f ` G )

Assertion

Ref	Expression
plusffvalg	|- ( G e. V -> .+^ = ( x e. B , y e. B |-> ( x .+ y ) ) )

Distinct variable groups:   x, y, B   x, G, y   x, .+ , y   x, V, y

Allowed substitution hints:   .+^ ( x, y)

Proof of Theorem plusffvalg

Dummy variable g is distinct from all other variables.

Step	Hyp	Ref	Expression
1		plusffval.3	. 2 |- .+^ = ( +f ` G )
2		df-plusf 13675	. . 3 |- +f = ( g e. _V |-> ( x e. ( Base ` g ) , y e. ( Base ` g ) |-> ( x ( +g ` g ) y ) ) )
3		fveq2 5695	. . . . 5 |- ( g = G -> ( Base ` g ) = ( Base ` G ) )
4		plusffval.1	. . . . 5 |- B = ( Base ` G )
5	3, 4	eqtr4di 2289	. . . 4 |- ( g = G -> ( Base ` g ) = B )
6		fveq2 5695	. . . . . 6 |- ( g = G -> ( +g ` g ) = ( +g ` G ) )
7		plusffval.2	. . . . . 6 |- .+ = ( +g ` G )
8	6, 7	eqtr4di 2289	. . . . 5 |- ( g = G -> ( +g ` g ) = .+ )
9	8	oveqd 6102	. . . 4 |- ( g = G -> ( x ( +g ` g ) y ) = ( x .+ y ) )
10	5, 5, 9	mpoeq123dv 6150	. . 3 |- ( g = G -> ( x e. ( Base ` g ) , y e. ( Base ` g ) |-> ( x ( +g ` g ) y ) ) = ( x e. B , y e. B |-> ( x .+ y ) ) )
11		elex 2833	. . 3 |- ( G e. V -> G e. _V )
12		basfn 13411	. . . . . 6 |- Base Fn _V
13		funfvex 5712	. . . . . . 7 |- ( ( Fun Base /\ G e. dom Base ) -> ( Base ` G ) e. _V )
14	13	funfni 5483	. . . . . 6 |- ( ( Base Fn _V /\ G e. _V ) -> ( Base ` G ) e. _V )
15	12, 11, 14	sylancr 418	. . . . 5 |- ( G e. V -> ( Base ` G ) e. _V )
16	4, 15	eqeltrid 2325	. . . 4 |- ( G e. V -> B e. _V )
17		mpoexga 6448	. . . 4 |- ( ( B e. _V /\ B e. _V ) -> ( x e. B , y e. B |-> ( x .+ y ) ) e. _V )
18	16, 16, 17	syl2anc 415	. . 3 |- ( G e. V -> ( x e. B , y e. B |-> ( x .+ y ) ) e. _V )
19	2, 10, 11, 18	fvmptd3 5799	. 2 |- ( G e. V -> ( +f ` G ) = ( x e. B , y e. B |-> ( x .+ y ) ) )
20	1, 19	eqtrid 2283	1 |- ( G e. V -> .+^ = ( x e. B , y e. B |-> ( x .+ y ) ) )

This proof depends on syntax axioms:   -> wi 4   = wceq 1402   e. wcel 2209   _Vcvv 2821   Fn wfn 5372   ` cfv 5377  (class class class)co 6085   e. cmpo 6087   Basecbs 13352   +g cplusg 13431   +fcplusf 13673

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  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 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  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-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-inn 9305  df-ndx 13355  df-slot 13356  df-base 13358  df-plusf 13675

This theorem is used by:  plusfvalg  13683  plusfeqg  13684  plusffng  13685  mgmplusf  13686