ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  plusffvalg Unicode version

Theorem plusffvalg 13625
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.
StepHypRef Expression
1 plusffval.3 . 2  |-  .+^  =  ( +f `  G
)
2 df-plusf 13618 . . 3  |-  +f 
=  ( g  e. 
_V  |->  ( x  e.  ( Base `  g
) ,  y  e.  ( Base `  g
)  |->  ( x ( +g  `  g ) y ) ) )
3 fveq2 5675 . . . . 5  |-  ( g  =  G  ->  ( Base `  g )  =  ( Base `  G
) )
4 plusffval.1 . . . . 5  |-  B  =  ( Base `  G
)
53, 4eqtr4di 2285 . . . 4  |-  ( g  =  G  ->  ( Base `  g )  =  B )
6 fveq2 5675 . . . . . 6  |-  ( g  =  G  ->  ( +g  `  g )  =  ( +g  `  G
) )
7 plusffval.2 . . . . . 6  |-  .+  =  ( +g  `  G )
86, 7eqtr4di 2285 . . . . 5  |-  ( g  =  G  ->  ( +g  `  g )  = 
.+  )
98oveqd 6075 . . . 4  |-  ( g  =  G  ->  (
x ( +g  `  g
) y )  =  ( x  .+  y
) )
105, 5, 9mpoeq123dv 6123 . . 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 2827 . . 3  |-  ( G  e.  V  ->  G  e.  _V )
12 basfn 13355 . . . . . 6  |-  Base  Fn  _V
13 funfvex 5692 . . . . . . 7  |-  ( ( Fun  Base  /\  G  e. 
dom  Base )  ->  ( Base `  G )  e. 
_V )
1413funfni 5463 . . . . . 6  |-  ( (
Base  Fn  _V  /\  G  e.  _V )  ->  ( Base `  G )  e. 
_V )
1512, 11, 14sylancr 414 . . . . 5  |-  ( G  e.  V  ->  ( Base `  G )  e. 
_V )
164, 15eqeltrid 2321 . . . 4  |-  ( G  e.  V  ->  B  e.  _V )
17 mpoexga 6421 . . . 4  |-  ( ( B  e.  _V  /\  B  e.  _V )  ->  ( x  e.  B ,  y  e.  B  |->  ( x  .+  y
) )  e.  _V )
1816, 16, 17syl2anc 411 . . 3  |-  ( G  e.  V  ->  (
x  e.  B , 
y  e.  B  |->  ( x  .+  y ) )  e.  _V )
192, 10, 11, 18fvmptd3 5776 . 2  |-  ( G  e.  V  ->  ( +f `  G
)  =  ( x  e.  B ,  y  e.  B  |->  ( x 
.+  y ) ) )
201, 19eqtrid 2279 1  |-  ( G  e.  V  ->  .+^  =  ( x  e.  B , 
y  e.  B  |->  ( x  .+  y ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    e. wcel 2205   _Vcvv 2815    Fn wfn 5352   ` cfv 5357  (class class class)co 6058    e. cmpo 6060   Basecbs 13296   +g cplusg 13374   +fcplusf 13616
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-cnex 8234  ax-resscn 8235  ax-1re 8237  ax-addrcl 8240
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-inn 9255  df-ndx 13299  df-slot 13300  df-base 13302  df-plusf 13618
This theorem is referenced by:  plusfvalg  13626  plusfeqg  13627  plusffng  13628  mgmplusf  13629
  Copyright terms: Public domain W3C validator