Theorem plusffvalg 13005

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 12998	. . 3 |- +f = ( g e. _V |-> ( x e. ( Base ` g ) , y e. ( Base ` g ) |-> ( x ( +g ` g ) y ) ) )
3		fveq2 5558	. . . . 5 |- ( g = G -> ( Base ` g ) = ( Base ` G ) )
4		plusffval.1	. . . . 5 |- B = ( Base ` G )
5	3, 4	eqtr4di 2247	. . . 4 |- ( g = G -> ( Base ` g ) = B )
6		fveq2 5558	. . . . . 6 |- ( g = G -> ( +g ` g ) = ( +g ` G ) )
7		plusffval.2	. . . . . 6 |- .+ = ( +g ` G )
8	6, 7	eqtr4di 2247	. . . . 5 |- ( g = G -> ( +g ` g ) = .+ )
9	8	oveqd 5939	. . . 4 |- ( g = G -> ( x ( +g ` g ) y ) = ( x .+ y ) )
10	5, 5, 9	mpoeq123dv 5984	. . 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 2774	. . 3 |- ( G e. V -> G e. _V )
12		basfn 12736	. . . . . 6 |- Base Fn _V
13		funfvex 5575	. . . . . . 7 |- ( ( Fun Base /\ G e. dom Base ) -> ( Base ` G ) e. _V )
14	13	funfni 5358	. . . . . 6 |- ( ( Base Fn _V /\ G e. _V ) -> ( Base ` G ) e. _V )
15	12, 11, 14	sylancr 414	. . . . 5 |- ( G e. V -> ( Base ` G ) e. _V )
16	4, 15	eqeltrid 2283	. . . 4 |- ( G e. V -> B e. _V )
17		mpoexga 6270	. . . 4 |- ( ( B e. _V /\ B e. _V ) -> ( x e. B , y e. B |-> ( x .+ y ) ) e. _V )
18	16, 16, 17	syl2anc 411	. . 3 |- ( G e. V -> ( x e. B , y e. B |-> ( x .+ y ) ) e. _V )
19	2, 10, 11, 18	fvmptd3 5655	. 2 |- ( G e. V -> ( +f ` G ) = ( x e. B , y e. B |-> ( x .+ y ) ) )
20	1, 19	eqtrid 2241	1 |- ( G e. V -> .+^ = ( x e. B , y e. B |-> ( x .+ y ) ) )

Syntax hints:   -> wi 4   = wceq 1364   e. wcel 2167   _Vcvv 2763   Fn wfn 5253   ` cfv 5258  (class class class)co 5922   e. cmpo 5924   Basecbs 12678   +g cplusg 12755   +fcplusf 12996

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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-cnex 7970  ax-resscn 7971  ax-1re 7973  ax-addrcl 7976

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-inn 8991  df-ndx 12681  df-slot 12682  df-base 12684  df-plusf 12998

This theorem is referenced by:  plusfvalg  13006  plusfeqg  13007  plusffng  13008  mgmplusf  13009