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

Theorem isgrpinv 13582
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 13571 . . . . . . . . 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 534 . . . . . . . . . . 11  |-  ( ( ( ( G  e. 
Grp  /\  M : B
--> B )  /\  x  e.  B )  /\  (
( M `  x
)  .+  x )  =  .0.  )  ->  M : B --> B )
9 simplr 528 . . . . . . . . . . 11  |-  ( ( ( ( G  e. 
Grp  /\  M : B
--> B )  /\  x  e.  B )  /\  (
( M `  x
)  .+  x )  =  .0.  )  ->  x  e.  B )
108, 9ffvelcdmd 5770 . . . . . . . . . 10  |-  ( ( ( ( G  e. 
Grp  /\  M : B
--> B )  /\  x  e.  B )  /\  (
( M `  x
)  .+  x )  =  .0.  )  ->  ( M `  x )  e.  B )
111, 2, 3grpinveu 13566 . . . . . . . . . . 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 6007 . . . . . . . . . . . 12  |-  ( e  =  ( M `  x )  ->  (
e  .+  x )  =  ( ( M `
 x )  .+  x ) )
1413eqeq1d 2238 . . . . . . . . . . 11  |-  ( e  =  ( M `  x )  ->  (
( e  .+  x
)  =  .0.  <->  ( ( M `  x )  .+  x )  =  .0.  ) )
1514riota2 5977 . . . . . . . . . 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 2262 . . . . . . 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 2597 . . . . 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 13572 . . . . 5  |-  ( G  e.  Grp  ->  N  Fn  B )
23 ffn 5472 . . . . . 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 5731 . . . . 5  |-  ( ( N  Fn  B  /\  M  Fn  B )  ->  ( N  =  M  <->  A. x  e.  B  ( N `  x )  =  ( M `  x ) ) )
2622, 24, 25syl2an2r 597 . . . 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 13575 . . . 4  |-  ( G  e.  Grp  ->  N : B --> B )
301, 2, 3, 4grplinv 13578 . . . . 5  |-  ( ( G  e.  Grp  /\  x  e.  B )  ->  ( ( N `  x )  .+  x
)  =  .0.  )
3130ralrimiva 2603 . . . 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 5455 . . . 4  |-  ( N  =  M  ->  ( N : B --> B  <->  M : B
--> B ) )
34 fveq1 5625 . . . . . . 7  |-  ( N  =  M  ->  ( N `  x )  =  ( M `  x ) )
3534oveq1d 6015 . . . . . 6  |-  ( N  =  M  ->  (
( N `  x
)  .+  x )  =  ( ( M `
 x )  .+  x ) )
3635eqeq1d 2238 . . . . 5  |-  ( N  =  M  ->  (
( ( N `  x )  .+  x
)  =  .0.  <->  ( ( M `  x )  .+  x )  =  .0.  ) )
3736ralbidv 2530 . . . 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 1395    e. wcel 2200   A.wral 2508   E!wreu 2510    Fn wfn 5312   -->wf 5313   ` cfv 5317   iota_crio 5952  (class class class)co 6000   Basecbs 13027   +g cplusg 13105   0gc0g 13284   Grpcgrp 13528   invgcminusg 13529
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4198  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-cnex 8086  ax-resscn 8087  ax-1re 8089  ax-addrcl 8092
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-riota 5953  df-ov 6003  df-inn 9107  df-2 9165  df-ndx 13030  df-slot 13031  df-base 13033  df-plusg 13118  df-0g 13286  df-mgm 13384  df-sgrp 13430  df-mnd 13445  df-grp 13531  df-minusg 13532
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator