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

Theorem grpinvfng 13246
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 12761 . . . . . . 7  |-  Base  Fn  _V
3 elex 2774 . . . . . . 7  |-  ( G  e.  V  ->  G  e.  _V )
4 funfvex 5578 . . . . . . . 8  |-  ( ( Fun  Base  /\  G  e. 
dom  Base )  ->  ( Base `  G )  e. 
_V )
54funfni 5361 . . . . . . 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 2283 . . . . 5  |-  ( G  e.  V  ->  B  e.  _V )
8 riotaexg 5884 . . . . 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 2571 . . 3  |-  ( G  e.  V  ->  A. x  e.  B  ( iota_ y  e.  B  ( y ( +g  `  G
) x )  =  ( 0g `  G
) )  e.  _V )
11 eqid 2196 . . . 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 5387 . . 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 2196 . . . 4  |-  ( +g  `  G )  =  ( +g  `  G )
15 eqid 2196 . . . 4  |-  ( 0g
`  G )  =  ( 0g `  G
)
16 grpinvfn.n . . . 4  |-  N  =  ( invg `  G )
171, 14, 15, 16grpinvfvalg 13244 . . 3  |-  ( G  e.  V  ->  N  =  ( x  e.  B  |->  ( iota_ y  e.  B  ( y ( +g  `  G ) x )  =  ( 0g `  G ) ) ) )
1817fneq1d 5349 . 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 1364    e. wcel 2167   A.wral 2475   _Vcvv 2763    |-> cmpt 4095    Fn wfn 5254   ` cfv 5259   iota_crio 5879  (class class class)co 5925   Basecbs 12703   +g cplusg 12780   0gc0g 12958   invgcminusg 13203
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-cnex 7987  ax-resscn 7988  ax-1re 7990  ax-addrcl 7993
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-inn 9008  df-ndx 12706  df-slot 12707  df-base 12709  df-minusg 13206
This theorem is referenced by:  isgrpinv  13256  mulgval  13328  mulgfng  13330  invrfvald  13754
  Copyright terms: Public domain W3C validator