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

Theorem grpinv11 13824
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 5675 . . . . 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 13822 . . . . . 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 13822 . . . . . 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 2275 . . 3  |-  ( (
ph  /\  ( N `  X )  =  ( N `  Y ) )  ->  X  =  Y )
1514ex 115 . 2  |-  ( ph  ->  ( ( N `  X )  =  ( N `  Y )  ->  X  =  Y ) )
16 fveq2 5675 . 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 1398    e. wcel 2205   ` cfv 5357   Basecbs 13296   Grpcgrp 13755   invgcminusg 13756
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-cnex 8234  ax-resscn 8235  ax-1re 8237  ax-addrcl 8240
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-inn 9255  df-2 9313  df-ndx 13299  df-slot 13300  df-base 13302  df-plusg 13387  df-0g 13555  df-mgm 13619  df-sgrp 13665  df-mnd 13678  df-grp 13758  df-minusg 13759
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator