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

Theorem grpinv11 13651
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 5639 . . . . 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 13649 . . . . . 6  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( N `  ( N `  X )
)  =  X )
83, 4, 7syl2anc 411 . . . . 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 13649 . . . . . 6  |-  ( ( G  e.  Grp  /\  Y  e.  B )  ->  ( N `  ( N `  Y )
)  =  Y )
123, 10, 11syl2anc 411 . . . . 5  |-  ( ph  ->  ( N `  ( N `  Y )
)  =  Y )
1312adantr 276 . . . 4  |-  ( (
ph  /\  ( N `  X )  =  ( N `  Y ) )  ->  ( N `  ( N `  Y
) )  =  Y )
142, 9, 133eqtr3d 2272 . . 3  |-  ( (
ph  /\  ( N `  X )  =  ( N `  Y ) )  ->  X  =  Y )
1514ex 115 . 2  |-  ( ph  ->  ( ( N `  X )  =  ( N `  Y )  ->  X  =  Y ) )
16 fveq2 5639 . 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 1397    e. wcel 2202   ` cfv 5326   Basecbs 13081   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