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

Theorem grpinvfng 13688
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 13202 . . . . . . 7  |-  Base  Fn  _V
3 elex 2815 . . . . . . 7  |-  ( G  e.  V  ->  G  e.  _V )
4 funfvex 5665 . . . . . . . 8  |-  ( ( Fun  Base  /\  G  e. 
dom  Base )  ->  ( Base `  G )  e. 
_V )
54funfni 5439 . . . . . . 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 2318 . . . . 5  |-  ( G  e.  V  ->  B  e.  _V )
8 riotaexg 5985 . . . . 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 2607 . . 3  |-  ( G  e.  V  ->  A. x  e.  B  ( iota_ y  e.  B  ( y ( +g  `  G
) x )  =  ( 0g `  G
) )  e.  _V )
11 eqid 2231 . . . 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 5466 . . 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 2231 . . . 4  |-  ( +g  `  G )  =  ( +g  `  G )
15 eqid 2231 . . . 4  |-  ( 0g
`  G )  =  ( 0g `  G
)
16 grpinvfn.n . . . 4  |-  N  =  ( invg `  G )
171, 14, 15, 16grpinvfvalg 13686 . . 3  |-  ( G  e.  V  ->  N  =  ( x  e.  B  |->  ( iota_ y  e.  B  ( y ( +g  `  G ) x )  =  ( 0g `  G ) ) ) )
1817fneq1d 5427 . 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 1398    e. wcel 2202   A.wral 2511   _Vcvv 2803    |-> cmpt 4155    Fn wfn 5328   ` cfv 5333   iota_crio 5980  (class class class)co 6028   Basecbs 13143   +g cplusg 13221   0gc0g 13400   invgcminusg 13645
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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-cnex 8166  ax-resscn 8167  ax-1re 8169  ax-addrcl 8172
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-inn 9187  df-ndx 13146  df-slot 13147  df-base 13149  df-minusg 13648
This theorem is referenced by:  isgrpinv  13698  mulgval  13770  mulgfng  13772  invrfvald  14198
  Copyright terms: Public domain W3C validator