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

Theorem grpinv11 13851
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 5690 . . . . 5  |-  ( ( N `  X )  =  ( N `  Y )  ->  ( N `  ( N `  X ) )  =  ( N `  ( N `  Y )
) )
21adantl 277 . . . 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 13849 . . . . . 6  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( N `  ( N `  X )
)  =  X )
83, 4, 7syl2anc 415 . . . . 5  |-  ( ph  ->  ( N `  ( N `  X )
)  =  X )
98adantr 276 . . . 4  |-  ( (
ph  /\  ( N `  X )  =  ( N `  Y ) )  ->  ( N `  ( N `  X
) )  =  X )
10 grpinv11.y . . . . . 6  |-  ( ph  ->  Y  e.  B )
115, 6grpinvinv 13849 . . . . . 6  |-  ( ( G  e.  Grp  /\  Y  e.  B )  ->  ( N `  ( N `  Y )
)  =  Y )
123, 10, 11syl2anc 415 . . . . 5  |-  ( ph  ->  ( N `  ( N `  Y )
)  =  Y )
1312adantr 276 . . . 4  |-  ( (
ph  /\  ( N `  X )  =  ( N `  Y ) )  ->  ( N `  ( N `  Y
) )  =  Y )
142, 9, 133eqtr3d 2279 . . 3  |-  ( (
ph  /\  ( N `  X )  =  ( N `  Y ) )  ->  X  =  Y )
1514ex 115 . 2  |-  ( ph  ->  ( ( N `  X )  =  ( N `  Y )  ->  X  =  Y ) )
16 fveq2 5690 . 2  |-  ( X  =  Y  ->  ( N `  X )  =  ( N `  Y ) )
1715, 16impbid1 142 1  |-  ( ph  ->  ( ( N `  X )  =  ( N `  Y )  <-> 
X  =  Y ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   ` cfv 5372   Basecbs 13330   Grpcgrp 13782   invgcminusg 13783
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-cnex 8260  ax-resscn 8261  ax-1re 8263  ax-addrcl 8266
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-inn 9284  df-2 9342  df-ndx 13333  df-slot 13334  df-base 13336  df-plusg 13421  df-0g 13589  df-mgm 13653  df-sgrp 13694  df-mnd 13707  df-grp 13785  df-minusg 13786
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator