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

Theorem isgrpinv 13636
Description: Properties showing that a function  M is the inverse function of a group. (Contributed by NM, 7-Aug-2013.) (Revised by Mario Carneiro, 2-Oct-2015.)
Hypotheses
Ref Expression
grpinv.b  |-  B  =  ( Base `  G
)
grpinv.p  |-  .+  =  ( +g  `  G )
grpinv.u  |-  .0.  =  ( 0g `  G )
grpinv.n  |-  N  =  ( invg `  G )
Assertion
Ref Expression
isgrpinv  |-  ( G  e.  Grp  ->  (
( M : B --> B  /\  A. x  e.  B  ( ( M `
 x )  .+  x )  =  .0.  )  <->  N  =  M
) )
Distinct variable groups:    x, B    x, G    x,  .0.    x,  .+    x, M   
x, N

Proof of Theorem isgrpinv
Dummy variable  e is distinct from all other variables.
StepHypRef Expression
1 grpinv.b . . . . . . . . . 10  |-  B  =  ( Base `  G
)
2 grpinv.p . . . . . . . . . 10  |-  .+  =  ( +g  `  G )
3 grpinv.u . . . . . . . . . 10  |-  .0.  =  ( 0g `  G )
4 grpinv.n . . . . . . . . . 10  |-  N  =  ( invg `  G )
51, 2, 3, 4grpinvval 13625 . . . . . . . . 9  |-  ( x  e.  B  ->  ( N `  x )  =  ( iota_ e  e.  B  ( e  .+  x )  =  .0.  ) )
65ad2antlr 489 . . . . . . . 8  |-  ( ( ( ( G  e. 
Grp  /\  M : B
--> B )  /\  x  e.  B )  /\  (
( M `  x
)  .+  x )  =  .0.  )  ->  ( N `  x )  =  ( iota_ e  e.  B  ( e  .+  x )  =  .0.  ) )
7 simpr 110 . . . . . . . . 9  |-  ( ( ( ( G  e. 
Grp  /\  M : B
--> B )  /\  x  e.  B )  /\  (
( M `  x
)  .+  x )  =  .0.  )  ->  (
( M `  x
)  .+  x )  =  .0.  )
8 simpllr 536 . . . . . . . . . . 11  |-  ( ( ( ( G  e. 
Grp  /\  M : B
--> B )  /\  x  e.  B )  /\  (
( M `  x
)  .+  x )  =  .0.  )  ->  M : B --> B )
9 simplr 529 . . . . . . . . . . 11  |-  ( ( ( ( G  e. 
Grp  /\  M : B
--> B )  /\  x  e.  B )  /\  (
( M `  x
)  .+  x )  =  .0.  )  ->  x  e.  B )
108, 9ffvelcdmd 5783 . . . . . . . . . 10  |-  ( ( ( ( G  e. 
Grp  /\  M : B
--> B )  /\  x  e.  B )  /\  (
( M `  x
)  .+  x )  =  .0.  )  ->  ( M `  x )  e.  B )
111, 2, 3grpinveu 13620 . . . . . . . . . . 11  |-  ( ( G  e.  Grp  /\  x  e.  B )  ->  E! e  e.  B  ( e  .+  x
)  =  .0.  )
1211ad4ant13 513 . . . . . . . . . 10  |-  ( ( ( ( G  e. 
Grp  /\  M : B
--> B )  /\  x  e.  B )  /\  (
( M `  x
)  .+  x )  =  .0.  )  ->  E! e  e.  B  (
e  .+  x )  =  .0.  )
13 oveq1 6024 . . . . . . . . . . . 12  |-  ( e  =  ( M `  x )  ->  (
e  .+  x )  =  ( ( M `
 x )  .+  x ) )
1413eqeq1d 2240 . . . . . . . . . . 11  |-  ( e  =  ( M `  x )  ->  (
( e  .+  x
)  =  .0.  <->  ( ( M `  x )  .+  x )  =  .0.  ) )
1514riota2 5994 . . . . . . . . . 10  |-  ( ( ( M `  x
)  e.  B  /\  E! e  e.  B  ( e  .+  x
)  =  .0.  )  ->  ( ( ( M `
 x )  .+  x )  =  .0.  <->  (
iota_ e  e.  B  ( e  .+  x
)  =  .0.  )  =  ( M `  x ) ) )
1610, 12, 15syl2anc 411 . . . . . . . . 9  |-  ( ( ( ( G  e. 
Grp  /\  M : B
--> B )  /\  x  e.  B )  /\  (
( M `  x
)  .+  x )  =  .0.  )  ->  (
( ( M `  x )  .+  x
)  =  .0.  <->  ( iota_ e  e.  B  ( e 
.+  x )  =  .0.  )  =  ( M `  x ) ) )
177, 16mpbid 147 . . . . . . . 8  |-  ( ( ( ( G  e. 
Grp  /\  M : B
--> B )  /\  x  e.  B )  /\  (
( M `  x
)  .+  x )  =  .0.  )  ->  ( iota_ e  e.  B  ( e  .+  x )  =  .0.  )  =  ( M `  x
) )
186, 17eqtrd 2264 . . . . . . 7  |-  ( ( ( ( G  e. 
Grp  /\  M : B
--> B )  /\  x  e.  B )  /\  (
( M `  x
)  .+  x )  =  .0.  )  ->  ( N `  x )  =  ( M `  x ) )
1918ex 115 . . . . . 6  |-  ( ( ( G  e.  Grp  /\  M : B --> B )  /\  x  e.  B
)  ->  ( (
( M `  x
)  .+  x )  =  .0.  ->  ( N `  x )  =  ( M `  x ) ) )
2019ralimdva 2599 . . . . 5  |-  ( ( G  e.  Grp  /\  M : B --> B )  ->  ( A. x  e.  B  ( ( M `  x )  .+  x )  =  .0. 
->  A. x  e.  B  ( N `  x )  =  ( M `  x ) ) )
2120impr 379 . . . 4  |-  ( ( G  e.  Grp  /\  ( M : B --> B  /\  A. x  e.  B  ( ( M `  x
)  .+  x )  =  .0.  ) )  ->  A. x  e.  B  ( N `  x )  =  ( M `  x ) )
221, 4grpinvfng 13626 . . . . 5  |-  ( G  e.  Grp  ->  N  Fn  B )
23 ffn 5482 . . . . . 6  |-  ( M : B --> B  ->  M  Fn  B )
2423ad2antrl 490 . . . . 5  |-  ( ( G  e.  Grp  /\  ( M : B --> B  /\  A. x  e.  B  ( ( M `  x
)  .+  x )  =  .0.  ) )  ->  M  Fn  B )
25 eqfnfv 5744 . . . . 5  |-  ( ( N  Fn  B  /\  M  Fn  B )  ->  ( N  =  M  <->  A. x  e.  B  ( N `  x )  =  ( M `  x ) ) )
2622, 24, 25syl2an2r 599 . . . 4  |-  ( ( G  e.  Grp  /\  ( M : B --> B  /\  A. x  e.  B  ( ( M `  x
)  .+  x )  =  .0.  ) )  -> 
( N  =  M  <->  A. x  e.  B  ( N `  x )  =  ( M `  x ) ) )
2721, 26mpbird 167 . . 3  |-  ( ( G  e.  Grp  /\  ( M : B --> B  /\  A. x  e.  B  ( ( M `  x
)  .+  x )  =  .0.  ) )  ->  N  =  M )
2827ex 115 . 2  |-  ( G  e.  Grp  ->  (
( M : B --> B  /\  A. x  e.  B  ( ( M `
 x )  .+  x )  =  .0.  )  ->  N  =  M ) )
291, 4grpinvf 13629 . . . 4  |-  ( G  e.  Grp  ->  N : B --> B )
301, 2, 3, 4grplinv 13632 . . . . 5  |-  ( ( G  e.  Grp  /\  x  e.  B )  ->  ( ( N `  x )  .+  x
)  =  .0.  )
3130ralrimiva 2605 . . . 4  |-  ( G  e.  Grp  ->  A. x  e.  B  ( ( N `  x )  .+  x )  =  .0.  )
3229, 31jca 306 . . 3  |-  ( G  e.  Grp  ->  ( N : B --> B  /\  A. x  e.  B  ( ( N `  x
)  .+  x )  =  .0.  ) )
33 feq1 5465 . . . 4  |-  ( N  =  M  ->  ( N : B --> B  <->  M : B
--> B ) )
34 fveq1 5638 . . . . . . 7  |-  ( N  =  M  ->  ( N `  x )  =  ( M `  x ) )
3534oveq1d 6032 . . . . . 6  |-  ( N  =  M  ->  (
( N `  x
)  .+  x )  =  ( ( M `
 x )  .+  x ) )
3635eqeq1d 2240 . . . . 5  |-  ( N  =  M  ->  (
( ( N `  x )  .+  x
)  =  .0.  <->  ( ( M `  x )  .+  x )  =  .0.  ) )
3736ralbidv 2532 . . . 4  |-  ( N  =  M  ->  ( A. x  e.  B  ( ( N `  x )  .+  x
)  =  .0.  <->  A. x  e.  B  ( ( M `  x )  .+  x )  =  .0.  ) )
3833, 37anbi12d 473 . . 3  |-  ( N  =  M  ->  (
( N : B --> B  /\  A. x  e.  B  ( ( N `
 x )  .+  x )  =  .0.  )  <->  ( M : B
--> B  /\  A. x  e.  B  ( ( M `  x )  .+  x )  =  .0.  ) ) )
3932, 38syl5ibcom 155 . 2  |-  ( G  e.  Grp  ->  ( N  =  M  ->  ( M : B --> B  /\  A. x  e.  B  ( ( M `  x
)  .+  x )  =  .0.  ) ) )
4028, 39impbid 129 1  |-  ( G  e.  Grp  ->  (
( M : B --> B  /\  A. x  e.  B  ( ( M `
 x )  .+  x )  =  .0.  )  <->  N  =  M
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1397    e. wcel 2202   A.wral 2510   E!wreu 2512    Fn wfn 5321   -->wf 5322   ` cfv 5326   iota_crio 5969  (class class class)co 6017   Basecbs 13081   +g cplusg 13159   0gc0g 13338   Grpcgrp 13582   invgcminusg 13583
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-rmo 2518  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-riota 5970  df-ov 6020  df-inn 9143  df-2 9201  df-ndx 13084  df-slot 13085  df-base 13087  df-plusg 13172  df-0g 13340  df-mgm 13438  df-sgrp 13484  df-mnd 13499  df-grp 13585  df-minusg 13586
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator