Theorem plusffvalg 13435

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 13428	. . 3 |- +f = ( g e. _V |-> ( x e. ( Base ` g ) , y e. ( Base ` g ) |-> ( x ( +g ` g ) y ) ) )
3		fveq2 5635	. . . . 5 |- ( g = G -> ( Base ` g ) = ( Base ` G ) )
4		plusffval.1	. . . . 5 |- B = ( Base ` G )
5	3, 4	eqtr4di 2280	. . . 4 |- ( g = G -> ( Base ` g ) = B )
6		fveq2 5635	. . . . . 6 |- ( g = G -> ( +g ` g ) = ( +g ` G ) )
7		plusffval.2	. . . . . 6 |- .+ = ( +g ` G )
8	6, 7	eqtr4di 2280	. . . . 5 |- ( g = G -> ( +g ` g ) = .+ )
9	8	oveqd 6030	. . . 4 |- ( g = G -> ( x ( +g ` g ) y ) = ( x .+ y ) )
10	5, 5, 9	mpoeq123dv 6078	. . 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 2812	. . 3 |- ( G e. V -> G e. _V )
12		basfn 13131	. . . . . 6 |- Base Fn _V
13		funfvex 5652	. . . . . . 7 |- ( ( Fun Base /\ G e. dom Base ) -> ( Base ` G ) e. _V )
14	13	funfni 5429	. . . . . 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 2316	. . . 4 |- ( G e. V -> B e. _V )
17		mpoexga 6372	. . . 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 5736	. 2 |- ( G e. V -> ( +f ` G ) = ( x e. B , y e. B |-> ( x .+ y ) ) )
20	1, 19	eqtrid 2274	1 |- ( G e. V -> .+^ = ( x e. B , y e. B |-> ( x .+ y ) ) )

Syntax hints:   -> wi 4   = wceq 1395   e. wcel 2200   _Vcvv 2800   Fn wfn 5319   ` cfv 5324  (class class class)co 6013   e. cmpo 6015   Basecbs 13072   +g cplusg 13150   +fcplusf 13426

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-cnex 8113  ax-resscn 8114  ax-1re 8116  ax-addrcl 8119

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-inn 9134  df-ndx 13075  df-slot 13076  df-base 13078  df-plusf 13428

This theorem is referenced by:  plusfvalg  13436  plusfeqg  13437  plusffng  13438  mgmplusf  13439