MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  grpinv11 Structured version   Visualization version   Unicode version

Theorem grpinv11 17484
Description: The group inverse is one-to-one. (Contributed by NM, 22-Mar-2015.)
Hypotheses
Ref Expression
grpinvinv.b  |-  B  =  ( Base `  G
)
grpinvinv.n  |-  N  =  ( invg `  G )
grpinv11.g  |-  ( ph  ->  G  e.  Grp )
grpinv11.x  |-  ( ph  ->  X  e.  B )
grpinv11.y  |-  ( ph  ->  Y  e.  B )
Assertion
Ref Expression
grpinv11  |-  ( ph  ->  ( ( N `  X )  =  ( N `  Y )  <-> 
X  =  Y ) )

Proof of Theorem grpinv11
StepHypRef Expression
1 fveq2 6191 . . . . 5  |-  ( ( N `  X )  =  ( N `  Y )  ->  ( N `  ( N `  X ) )  =  ( N `  ( N `  Y )
) )
21adantl 482 . . . 4  |-  ( (
ph  /\  ( N `  X )  =  ( N `  Y ) )  ->  ( N `  ( N `  X
) )  =  ( N `  ( N `
 Y ) ) )
3 grpinv11.g . . . . . 6  |-  ( ph  ->  G  e.  Grp )
4 grpinv11.x . . . . . 6  |-  ( ph  ->  X  e.  B )
5 grpinvinv.b . . . . . . 7  |-  B  =  ( Base `  G
)
6 grpinvinv.n . . . . . . 7  |-  N  =  ( invg `  G )
75, 6grpinvinv 17482 . . . . . 6  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( N `  ( N `  X )
)  =  X )
83, 4, 7syl2anc 693 . . . . 5  |-  ( ph  ->  ( N `  ( N `  X )
)  =  X )
98adantr 481 . . . 4  |-  ( (
ph  /\  ( N `  X )  =  ( N `  Y ) )  ->  ( N `  ( N `  X
) )  =  X )
10 grpinv11.y . . . . . 6  |-  ( ph  ->  Y  e.  B )
115, 6grpinvinv 17482 . . . . . 6  |-  ( ( G  e.  Grp  /\  Y  e.  B )  ->  ( N `  ( N `  Y )
)  =  Y )
123, 10, 11syl2anc 693 . . . . 5  |-  ( ph  ->  ( N `  ( N `  Y )
)  =  Y )
1312adantr 481 . . . 4  |-  ( (
ph  /\  ( N `  X )  =  ( N `  Y ) )  ->  ( N `  ( N `  Y
) )  =  Y )
142, 9, 133eqtr3d 2664 . . 3  |-  ( (
ph  /\  ( N `  X )  =  ( N `  Y ) )  ->  X  =  Y )
1514ex 450 . 2  |-  ( ph  ->  ( ( N `  X )  =  ( N `  Y )  ->  X  =  Y ) )
16 fveq2 6191 . 2  |-  ( X  =  Y  ->  ( N `  X )  =  ( N `  Y ) )
1715, 16impbid1 215 1  |-  ( ph  ->  ( ( N `  X )  =  ( N `  Y )  <-> 
X  =  Y ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    = wceq 1483    e. wcel 1990   ` cfv 5888   Basecbs 15857   Grpcgrp 17422   invgcminusg 17423
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-0g 16102  df-mgm 17242  df-sgrp 17284  df-mnd 17295  df-grp 17425  df-minusg 17426
This theorem is referenced by:  gexdvds  17999  dchrisum0re  25202  mapdpglem30  36991
  Copyright terms: Public domain W3C validator