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

Theorem plusffng 13447
Description: The group addition operation is a function. (Contributed by Mario Carneiro, 20-Sep-2015.)
Hypotheses
Ref Expression
plusffn.1  |-  B  =  ( Base `  G
)
plusffn.2  |-  .+^  =  ( +f `  G
)
Assertion
Ref Expression
plusffng  |-  ( G  e.  V  ->  .+^  Fn  ( B  X.  B ) )

Proof of Theorem plusffng
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 2805 . . . . 5  |-  x  e. 
_V
2 plusgslid 13194 . . . . . 6  |-  ( +g  = Slot  ( +g  `  ndx )  /\  ( +g  `  ndx )  e.  NN )
32slotex 13108 . . . . 5  |-  ( G  e.  V  ->  ( +g  `  G )  e. 
_V )
4 vex 2805 . . . . . 6  |-  y  e. 
_V
54a1i 9 . . . . 5  |-  ( ( G  e.  V  /\  ( x  e.  B  /\  y  e.  B
) )  ->  y  e.  _V )
6 ovexg 6051 . . . . 5  |-  ( ( x  e.  _V  /\  ( +g  `  G )  e.  _V  /\  y  e.  _V )  ->  (
x ( +g  `  G
) y )  e. 
_V )
71, 3, 5, 6mp3an2ani 1380 . . . 4  |-  ( ( G  e.  V  /\  ( x  e.  B  /\  y  e.  B
) )  ->  (
x ( +g  `  G
) y )  e. 
_V )
87ralrimivva 2614 . . 3  |-  ( G  e.  V  ->  A. x  e.  B  A. y  e.  B  ( x
( +g  `  G ) y )  e.  _V )
9 eqid 2231 . . . 4  |-  ( x  e.  B ,  y  e.  B  |->  ( x ( +g  `  G
) y ) )  =  ( x  e.  B ,  y  e.  B  |->  ( x ( +g  `  G ) y ) )
109fnmpo 6366 . . 3  |-  ( A. x  e.  B  A. y  e.  B  (
x ( +g  `  G
) y )  e. 
_V  ->  ( x  e.  B ,  y  e.  B  |->  ( x ( +g  `  G ) y ) )  Fn  ( B  X.  B
) )
118, 10syl 14 . 2  |-  ( G  e.  V  ->  (
x  e.  B , 
y  e.  B  |->  ( x ( +g  `  G
) y ) )  Fn  ( B  X.  B ) )
12 plusffn.1 . . . 4  |-  B  =  ( Base `  G
)
13 eqid 2231 . . . 4  |-  ( +g  `  G )  =  ( +g  `  G )
14 plusffn.2 . . . 4  |-  .+^  =  ( +f `  G
)
1512, 13, 14plusffvalg 13444 . . 3  |-  ( G  e.  V  ->  .+^  =  ( x  e.  B , 
y  e.  B  |->  ( x ( +g  `  G
) y ) ) )
1615fneq1d 5420 . 2  |-  ( G  e.  V  ->  (  .+^ 
Fn  ( B  X.  B )  <->  ( x  e.  B ,  y  e.  B  |->  ( x ( +g  `  G ) y ) )  Fn  ( B  X.  B
) ) )
1711, 16mpbird 167 1  |-  ( G  e.  V  ->  .+^  Fn  ( B  X.  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1397    e. wcel 2202   A.wral 2510   _Vcvv 2802    X. cxp 4723    Fn wfn 5321   ` cfv 5326  (class class class)co 6017    e. cmpo 6019   Basecbs 13081   +g cplusg 13159   +fcplusf 13435
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-cnex 8122  ax-resscn 8123  ax-1re 8125  ax-addrcl 8128
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-inn 9143  df-2 9201  df-ndx 13084  df-slot 13085  df-base 13087  df-plusg 13172  df-plusf 13437
This theorem is referenced by:  lmodfopnelem1  14337
  Copyright terms: Public domain W3C validator