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

Theorem plusfvalg 13576
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
plusfvalg  |-  ( ( G  e.  V  /\  X  e.  B  /\  Y  e.  B )  ->  ( X  .+^  Y )  =  ( X  .+  Y ) )

Proof of Theorem plusfvalg
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 plusffval.1 . . . 4  |-  B  =  ( Base `  G
)
2 plusffval.2 . . . 4  |-  .+  =  ( +g  `  G )
3 plusffval.3 . . . 4  |-  .+^  =  ( +f `  G
)
41, 2, 3plusffvalg 13575 . . 3  |-  ( G  e.  V  ->  .+^  =  ( x  e.  B , 
y  e.  B  |->  ( x  .+  y ) ) )
543ad2ant1 1045 . 2  |-  ( ( G  e.  V  /\  X  e.  B  /\  Y  e.  B )  -> 
.+^  =  ( x  e.  B ,  y  e.  B  |->  ( x 
.+  y ) ) )
6 oveq12 6059 . . 3  |-  ( ( x  =  X  /\  y  =  Y )  ->  ( x  .+  y
)  =  ( X 
.+  Y ) )
76adantl 277 . 2  |-  ( ( ( G  e.  V  /\  X  e.  B  /\  Y  e.  B
)  /\  ( x  =  X  /\  y  =  Y ) )  -> 
( x  .+  y
)  =  ( X 
.+  Y ) )
8 simp2 1025 . 2  |-  ( ( G  e.  V  /\  X  e.  B  /\  Y  e.  B )  ->  X  e.  B )
9 simp3 1026 . 2  |-  ( ( G  e.  V  /\  X  e.  B  /\  Y  e.  B )  ->  Y  e.  B )
10 plusgslid 13325 . . . . . 6  |-  ( +g  = Slot  ( +g  `  ndx )  /\  ( +g  `  ndx )  e.  NN )
1110slotex 13239 . . . . 5  |-  ( G  e.  V  ->  ( +g  `  G )  e. 
_V )
122, 11eqeltrid 2319 . . . 4  |-  ( G  e.  V  ->  .+  e.  _V )
13123ad2ant1 1045 . . 3  |-  ( ( G  e.  V  /\  X  e.  B  /\  Y  e.  B )  ->  .+  e.  _V )
14 ovexg 6084 . . 3  |-  ( ( X  e.  B  /\  .+  e.  _V  /\  Y  e.  B )  ->  ( X  .+  Y )  e. 
_V )
158, 13, 9, 14syl3anc 1274 . 2  |-  ( ( G  e.  V  /\  X  e.  B  /\  Y  e.  B )  ->  ( X  .+  Y
)  e.  _V )
165, 7, 8, 9, 15ovmpod 6181 1  |-  ( ( G  e.  V  /\  X  e.  B  /\  Y  e.  B )  ->  ( X  .+^  Y )  =  ( X  .+  Y ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1005    = wceq 1398    e. wcel 2203   _Vcvv 2813   ` cfv 5352  (class class class)co 6050    e. cmpo 6052   Basecbs 13212   +g cplusg 13290   +fcplusf 13566
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-in1 619  ax-in2 620  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 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1re 8221  ax-addrcl 8224
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-inn 9238  df-2 9296  df-ndx 13215  df-slot 13216  df-base 13218  df-plusg 13303  df-plusf 13568
This theorem is referenced by:  mndpfo  13651  lmodfopne  14474
  Copyright terms: Public domain W3C validator