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

Theorem grpinveu 13843
Description: The left inverse element of a group is unique. Lemma 2.2.1(b) of [Herstein] p. 55. (Contributed by NM, 24-Aug-2011.)
Hypotheses
Ref Expression
grpinveu.b  |-  B  =  ( Base `  G
)
grpinveu.p  |-  .+  =  ( +g  `  G )
grpinveu.o  |-  .0.  =  ( 0g `  G )
Assertion
Ref Expression
grpinveu  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  E! y  e.  B  ( y  .+  X
)  =  .0.  )
Distinct variable groups:    y, B    y, G    y,  .+    y,  .0.    y, X

Proof of Theorem grpinveu
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 grpinveu.b . . . 4  |-  B  =  ( Base `  G
)
2 grpinveu.p . . . 4  |-  .+  =  ( +g  `  G )
3 grpinveu.o . . . 4  |-  .0.  =  ( 0g `  G )
41, 2, 3grpinvex 13815 . . 3  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  E. y  e.  B  ( y  .+  X
)  =  .0.  )
5 eqtr3 2258 . . . . . . . . . . . 12  |-  ( ( ( y  .+  X
)  =  .0.  /\  ( z  .+  X
)  =  .0.  )  ->  ( y  .+  X
)  =  ( z 
.+  X ) )
61, 2grprcan 13842 . . . . . . . . . . . 12  |-  ( ( G  e.  Grp  /\  ( y  e.  B  /\  z  e.  B  /\  X  e.  B
) )  ->  (
( y  .+  X
)  =  ( z 
.+  X )  <->  y  =  z ) )
75, 6imbitrid 154 . . . . . . . . . . 11  |-  ( ( G  e.  Grp  /\  ( y  e.  B  /\  z  e.  B  /\  X  e.  B
) )  ->  (
( ( y  .+  X )  =  .0. 
/\  ( z  .+  X )  =  .0.  )  ->  y  =  z ) )
873exp2 1256 . . . . . . . . . 10  |-  ( G  e.  Grp  ->  (
y  e.  B  -> 
( z  e.  B  ->  ( X  e.  B  ->  ( ( ( y 
.+  X )  =  .0.  /\  ( z 
.+  X )  =  .0.  )  ->  y  =  z ) ) ) ) )
98com24 87 . . . . . . . . 9  |-  ( G  e.  Grp  ->  ( X  e.  B  ->  ( z  e.  B  -> 
( y  e.  B  ->  ( ( ( y 
.+  X )  =  .0.  /\  ( z 
.+  X )  =  .0.  )  ->  y  =  z ) ) ) ) )
109imp41 353 . . . . . . . 8  |-  ( ( ( ( G  e. 
Grp  /\  X  e.  B )  /\  z  e.  B )  /\  y  e.  B )  ->  (
( ( y  .+  X )  =  .0. 
/\  ( z  .+  X )  =  .0.  )  ->  y  =  z ) )
1110an32s 574 . . . . . . 7  |-  ( ( ( ( G  e. 
Grp  /\  X  e.  B )  /\  y  e.  B )  /\  z  e.  B )  ->  (
( ( y  .+  X )  =  .0. 
/\  ( z  .+  X )  =  .0.  )  ->  y  =  z ) )
1211expd 258 . . . . . 6  |-  ( ( ( ( G  e. 
Grp  /\  X  e.  B )  /\  y  e.  B )  /\  z  e.  B )  ->  (
( y  .+  X
)  =  .0.  ->  ( ( z  .+  X
)  =  .0.  ->  y  =  z ) ) )
1312ralrimdva 2630 . . . . 5  |-  ( ( ( G  e.  Grp  /\  X  e.  B )  /\  y  e.  B
)  ->  ( (
y  .+  X )  =  .0.  ->  A. z  e.  B  ( (
z  .+  X )  =  .0.  ->  y  =  z ) ) )
1413ancld 325 . . . 4  |-  ( ( ( G  e.  Grp  /\  X  e.  B )  /\  y  e.  B
)  ->  ( (
y  .+  X )  =  .0.  ->  ( (
y  .+  X )  =  .0.  /\  A. z  e.  B  ( (
z  .+  X )  =  .0.  ->  y  =  z ) ) ) )
1514reximdva 2652 . . 3  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( E. y  e.  B  ( y  .+  X )  =  .0. 
->  E. y  e.  B  ( ( y  .+  X )  =  .0. 
/\  A. z  e.  B  ( ( z  .+  X )  =  .0. 
->  y  =  z
) ) ) )
164, 15mpd 13 . 2  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  E. y  e.  B  ( ( y  .+  X )  =  .0. 
/\  A. z  e.  B  ( ( z  .+  X )  =  .0. 
->  y  =  z
) ) )
17 oveq1 6092 . . . 4  |-  ( y  =  z  ->  (
y  .+  X )  =  ( z  .+  X ) )
1817eqeq1d 2247 . . 3  |-  ( y  =  z  ->  (
( y  .+  X
)  =  .0.  <->  ( z  .+  X )  =  .0.  ) )
1918reu8 3022 . 2  |-  ( E! y  e.  B  ( y  .+  X )  =  .0.  <->  E. y  e.  B  ( (
y  .+  X )  =  .0.  /\  A. z  e.  B  ( (
z  .+  X )  =  .0.  ->  y  =  z ) ) )
2016, 19sylibr 134 1  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  E! y  e.  B  ( y  .+  X
)  =  .0.  )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    /\ w3a 1009    = wceq 1402    e. wcel 2209   A.wral 2528   E.wrex 2529   E!wreu 2530   ` cfv 5377  (class class class)co 6085   Basecbs 13352   +g cplusg 13431   0gc0g 13610   Grpcgrp 13805
This proof depends on 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-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276
This proof 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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-riota 6038  df-ov 6088  df-inn 9305  df-2 9363  df-ndx 13355  df-slot 13356  df-base 13358  df-plusg 13444  df-0g 13612  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-grp 13808
This theorem is used by:  grpinvf  13852  grplinv  13855  isgrpinv  13859
  Copyright terms: Public domain W3C validator