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

Theorem isgrpinv 12931
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 12921 . . . . . . . . 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 5654 . . . . . . . . . 10  |-  ( ( ( ( G  e. 
Grp  /\  M : B
--> B )  /\  x  e.  B )  /\  (
( M `  x
)  .+  x )  =  .0.  )  ->  ( M `  x )  e.  B )
111, 2, 3grpinveu 12916 . . . . . . . . . . 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 5884 . . . . . . . . . . . 12  |-  ( e  =  ( M `  x )  ->  (
e  .+  x )  =  ( ( M `
 x )  .+  x ) )
1413eqeq1d 2186 . . . . . . . . . . 11  |-  ( e  =  ( M `  x )  ->  (
( e  .+  x
)  =  .0.  <->  ( ( M `  x )  .+  x )  =  .0.  ) )
1514riota2 5855 . . . . . . . . . 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 2210 . . . . . . 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 2544 . . . . 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 12922 . . . . 5  |-  ( G  e.  Grp  ->  N  Fn  B )
23 ffn 5367 . . . . . 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 5615 . . . . 5  |-  ( ( N  Fn  B  /\  M  Fn  B )  ->  ( N  =  M  <->  A. x  e.  B  ( N `  x )  =  ( M `  x ) ) )
2622, 24, 25syl2an2r 595 . . . 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 12925 . . . 4  |-  ( G  e.  Grp  ->  N : B --> B )
301, 2, 3, 4grplinv 12927 . . . . 5  |-  ( ( G  e.  Grp  /\  x  e.  B )  ->  ( ( N `  x )  .+  x
)  =  .0.  )
3130ralrimiva 2550 . . . 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 5350 . . . 4  |-  ( N  =  M  ->  ( N : B --> B  <->  M : B
--> B ) )
34 fveq1 5516 . . . . . . 7  |-  ( N  =  M  ->  ( N `  x )  =  ( M `  x ) )
3534oveq1d 5892 . . . . . 6  |-  ( N  =  M  ->  (
( N `  x
)  .+  x )  =  ( ( M `
 x )  .+  x ) )
3635eqeq1d 2186 . . . . 5  |-  ( N  =  M  ->  (
( ( N `  x )  .+  x
)  =  .0.  <->  ( ( M `  x )  .+  x )  =  .0.  ) )
3736ralbidv 2477 . . . 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 1353    e. wcel 2148   A.wral 2455   E!wreu 2457    Fn wfn 5213   -->wf 5214   ` cfv 5218   iota_crio 5832  (class class class)co 5877   Basecbs 12464   +g cplusg 12538   0gc0g 12710   Grpcgrp 12882   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-rmo 2463  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-2 8980  df-ndx 12467  df-slot 12468  df-base 12470  df-plusg 12551  df-0g 12712  df-mgm 12780  df-sgrp 12813  df-mnd 12823  df-grp 12885  df-minusg 12886
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator