MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  plusffval Unicode version

Theorem plusffval 14395
Description: The group addition operation as a function. (Contributed by Mario Carneiro, 14-Aug-2015.)
Hypotheses
Ref Expression
plusffval.1  |-  B  =  ( Base `  G
)
plusffval.2  |-  .+  =  ( +g  `  G )
plusffval.3  |-  .+^  =  ( + f `  G
)
Assertion
Ref Expression
plusffval  |-  .+^  =  ( x  e.  B , 
y  e.  B  |->  ( x  .+  y ) )
Distinct variable groups:    x, y, B    x, G, y    x,  .+ , y
Allowed substitution hints:    .+^ ( x, y)

Proof of Theorem plusffval
Dummy variable  g is distinct from all other variables.
StepHypRef Expression
1 plusffval.3 . 2  |-  .+^  =  ( + f `  G
)
2 fveq2 5541 . . . . . 6  |-  ( g  =  G  ->  ( Base `  g )  =  ( Base `  G
) )
3 plusffval.1 . . . . . 6  |-  B  =  ( Base `  G
)
42, 3syl6eqr 2346 . . . . 5  |-  ( g  =  G  ->  ( Base `  g )  =  B )
5 fveq2 5541 . . . . . . 7  |-  ( g  =  G  ->  ( +g  `  g )  =  ( +g  `  G
) )
6 plusffval.2 . . . . . . 7  |-  .+  =  ( +g  `  G )
75, 6syl6eqr 2346 . . . . . 6  |-  ( g  =  G  ->  ( +g  `  g )  = 
.+  )
87oveqd 5891 . . . . 5  |-  ( g  =  G  ->  (
x ( +g  `  g
) y )  =  ( x  .+  y
) )
94, 4, 8mpt2eq123dv 5926 . . . 4  |-  ( g  =  G  ->  (
x  e.  ( Base `  g ) ,  y  e.  ( Base `  g
)  |->  ( x ( +g  `  g ) y ) )  =  ( x  e.  B ,  y  e.  B  |->  ( x  .+  y
) ) )
10 df-plusf 14384 . . . 4  |-  + f  =  ( g  e. 
_V  |->  ( x  e.  ( Base `  g
) ,  y  e.  ( Base `  g
)  |->  ( x ( +g  `  g ) y ) ) )
11 df-ov 5877 . . . . . . . 8  |-  ( x 
.+  y )  =  (  .+  `  <. x ,  y >. )
12 fvrn0 5566 . . . . . . . 8  |-  (  .+  ` 
<. x ,  y >.
)  e.  ( ran  .+  u.  { (/) } )
1311, 12eqeltri 2366 . . . . . . 7  |-  ( x 
.+  y )  e.  ( ran  .+  u.  {
(/) } )
1413rgen2w 2624 . . . . . 6  |-  A. x  e.  B  A. y  e.  B  ( x  .+  y )  e.  ( ran  .+  u.  { (/) } )
15 eqid 2296 . . . . . . 7  |-  ( x  e.  B ,  y  e.  B  |->  ( x 
.+  y ) )  =  ( x  e.  B ,  y  e.  B  |->  ( x  .+  y ) )
1615fmpt2 6207 . . . . . 6  |-  ( A. x  e.  B  A. y  e.  B  (
x  .+  y )  e.  ( ran  .+  u.  {
(/) } )  <->  ( x  e.  B ,  y  e.  B  |->  ( x  .+  y ) ) : ( B  X.  B
) --> ( ran  .+  u.  { (/) } ) )
1714, 16mpbi 199 . . . . 5  |-  ( x  e.  B ,  y  e.  B  |->  ( x 
.+  y ) ) : ( B  X.  B ) --> ( ran  .+  u.  { (/) } )
18 fvex 5555 . . . . . . 7  |-  ( Base `  G )  e.  _V
193, 18eqeltri 2366 . . . . . 6  |-  B  e. 
_V
2019, 19xpex 4817 . . . . 5  |-  ( B  X.  B )  e. 
_V
21 fvex 5555 . . . . . . . 8  |-  ( +g  `  G )  e.  _V
226, 21eqeltri 2366 . . . . . . 7  |-  .+  e.  _V
2322rnex 4958 . . . . . 6  |-  ran  .+  e.  _V
24 p0ex 4213 . . . . . 6  |-  { (/) }  e.  _V
2523, 24unex 4534 . . . . 5  |-  ( ran  .+  u.  { (/) } )  e.  _V
26 fex2 5417 . . . . 5  |-  ( ( ( x  e.  B ,  y  e.  B  |->  ( x  .+  y
) ) : ( B  X.  B ) --> ( ran  .+  u.  {
(/) } )  /\  ( B  X.  B )  e. 
_V  /\  ( ran  .+  u.  { (/) } )  e.  _V )  -> 
( x  e.  B ,  y  e.  B  |->  ( x  .+  y
) )  e.  _V )
2717, 20, 25, 26mp3an 1277 . . . 4  |-  ( x  e.  B ,  y  e.  B  |->  ( x 
.+  y ) )  e.  _V
289, 10, 27fvmpt 5618 . . 3  |-  ( G  e.  _V  ->  ( + f `  G )  =  ( x  e.  B ,  y  e.  B  |->  ( x  .+  y ) ) )
29 fvprc 5535 . . . . 5  |-  ( -.  G  e.  _V  ->  ( + f `  G
)  =  (/) )
30 mpt20 6215 . . . . 5  |-  ( x  e.  (/) ,  y  e.  (/)  |->  ( x  .+  y ) )  =  (/)
3129, 30syl6eqr 2346 . . . 4  |-  ( -.  G  e.  _V  ->  ( + f `  G
)  =  ( x  e.  (/) ,  y  e.  (/)  |->  ( x  .+  y ) ) )
32 fvprc 5535 . . . . . 6  |-  ( -.  G  e.  _V  ->  (
Base `  G )  =  (/) )
333, 32syl5eq 2340 . . . . 5  |-  ( -.  G  e.  _V  ->  B  =  (/) )
34 mpt2eq12 5924 . . . . 5  |-  ( ( B  =  (/)  /\  B  =  (/) )  ->  (
x  e.  B , 
y  e.  B  |->  ( x  .+  y ) )  =  ( x  e.  (/) ,  y  e.  (/)  |->  ( x  .+  y ) ) )
3533, 33, 34syl2anc 642 . . . 4  |-  ( -.  G  e.  _V  ->  ( x  e.  B , 
y  e.  B  |->  ( x  .+  y ) )  =  ( x  e.  (/) ,  y  e.  (/)  |->  ( x  .+  y ) ) )
3631, 35eqtr4d 2331 . . 3  |-  ( -.  G  e.  _V  ->  ( + f `  G
)  =  ( x  e.  B ,  y  e.  B  |->  ( x 
.+  y ) ) )
3728, 36pm2.61i 156 . 2  |-  ( + f `  G )  =  ( x  e.  B ,  y  e.  B  |->  ( x  .+  y ) )
381, 37eqtri 2316 1  |-  .+^  =  ( x  e.  B , 
y  e.  B  |->  ( x  .+  y ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    = wceq 1632    e. wcel 1696   A.wral 2556   _Vcvv 2801    u. cun 3163   (/)c0 3468   {csn 3653   <.cop 3656    X. cxp 4703   ran crn 4706   -->wf 5267   ` cfv 5271  (class class class)co 5874    e. cmpt2 5876   Basecbs 13164   +g cplusg 13224   + fcplusf 14380
This theorem is referenced by:  plusfval  14396  plusfeq  14397  plusffn  14398  mndplusf  14399  rlmscaf  15976  istgp2  17790  oppgtmd  17796  submtmd  17803  prdstmdd  17822  ressplusf  23313
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-sbc 3005  df-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-iun 3923  df-br 4040  df-opab 4094  df-mpt 4095  df-id 4325  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-fv 5279  df-ov 5877  df-oprab 5878  df-mpt2 5879  df-1st 6138  df-2nd 6139  df-plusf 14384
  Copyright terms: Public domain W3C validator