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

Theorem grpinvfng 12922
Description: Functionality of the group inverse function. (Contributed by Stefan O'Rear, 21-Mar-2015.)
Hypotheses
Ref Expression
grpinvfn.b  |-  B  =  ( Base `  G
)
grpinvfn.n  |-  N  =  ( invg `  G )
Assertion
Ref Expression
grpinvfng  |-  ( G  e.  V  ->  N  Fn  B )

Proof of Theorem grpinvfng
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 grpinvfn.b . . . . . 6  |-  B  =  ( Base `  G
)
2 basfn 12522 . . . . . . 7  |-  Base  Fn  _V
3 elex 2750 . . . . . . 7  |-  ( G  e.  V  ->  G  e.  _V )
4 funfvex 5534 . . . . . . . 8  |-  ( ( Fun  Base  /\  G  e. 
dom  Base )  ->  ( Base `  G )  e. 
_V )
54funfni 5318 . . . . . . 7  |-  ( (
Base  Fn  _V  /\  G  e.  _V )  ->  ( Base `  G )  e. 
_V )
62, 3, 5sylancr 414 . . . . . 6  |-  ( G  e.  V  ->  ( Base `  G )  e. 
_V )
71, 6eqeltrid 2264 . . . . 5  |-  ( G  e.  V  ->  B  e.  _V )
8 riotaexg 5837 . . . . 5  |-  ( B  e.  _V  ->  ( iota_ y  e.  B  ( y ( +g  `  G
) x )  =  ( 0g `  G
) )  e.  _V )
97, 8syl 14 . . . 4  |-  ( G  e.  V  ->  ( iota_ y  e.  B  ( y ( +g  `  G
) x )  =  ( 0g `  G
) )  e.  _V )
109ralrimivw 2551 . . 3  |-  ( G  e.  V  ->  A. x  e.  B  ( iota_ y  e.  B  ( y ( +g  `  G
) x )  =  ( 0g `  G
) )  e.  _V )
11 eqid 2177 . . . 4  |-  ( x  e.  B  |->  ( iota_ y  e.  B  ( y ( +g  `  G
) x )  =  ( 0g `  G
) ) )  =  ( x  e.  B  |->  ( iota_ y  e.  B  ( y ( +g  `  G ) x )  =  ( 0g `  G ) ) )
1211fnmpt 5344 . . 3  |-  ( A. x  e.  B  ( iota_ y  e.  B  ( y ( +g  `  G
) x )  =  ( 0g `  G
) )  e.  _V  ->  ( x  e.  B  |->  ( iota_ y  e.  B  ( y ( +g  `  G ) x )  =  ( 0g `  G ) ) )  Fn  B )
1310, 12syl 14 . 2  |-  ( G  e.  V  ->  (
x  e.  B  |->  (
iota_ y  e.  B  ( y ( +g  `  G ) x )  =  ( 0g `  G ) ) )  Fn  B )
14 eqid 2177 . . . 4  |-  ( +g  `  G )  =  ( +g  `  G )
15 eqid 2177 . . . 4  |-  ( 0g
`  G )  =  ( 0g `  G
)
16 grpinvfn.n . . . 4  |-  N  =  ( invg `  G )
171, 14, 15, 16grpinvfvalg 12920 . . 3  |-  ( G  e.  V  ->  N  =  ( x  e.  B  |->  ( iota_ y  e.  B  ( y ( +g  `  G ) x )  =  ( 0g `  G ) ) ) )
1817fneq1d 5308 . 2  |-  ( G  e.  V  ->  ( N  Fn  B  <->  ( x  e.  B  |->  ( iota_ y  e.  B  ( y ( +g  `  G
) x )  =  ( 0g `  G
) ) )  Fn  B ) )
1913, 18mpbird 167 1  |-  ( G  e.  V  ->  N  Fn  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1353    e. wcel 2148   A.wral 2455   _Vcvv 2739    |-> cmpt 4066    Fn wfn 5213   ` cfv 5218   iota_crio 5832  (class class class)co 5877   Basecbs 12464   +g cplusg 12538   0gc0g 12710   invgcminusg 12883
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4120  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-cnex 7904  ax-resscn 7905  ax-1re 7907  ax-addrcl 7910
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-riota 5833  df-ov 5880  df-inn 8922  df-ndx 12467  df-slot 12468  df-base 12470  df-minusg 12886
This theorem is referenced by:  isgrpinv  12931  mulgval  12991  mulgfng  12992  invrfvald  13296
  Copyright terms: Public domain W3C validator