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

Theorem grpsubeq0 13891
Description: If the difference between two group elements is zero, they are equal. (subeq0 8552 analog.) (Contributed by NM, 31-Mar-2014.)
Hypotheses
Ref Expression
grpsubid.b  |-  B  =  ( Base `  G
)
grpsubid.o  |-  .0.  =  ( 0g `  G )
grpsubid.m  |-  .-  =  ( -g `  G )
Assertion
Ref Expression
grpsubeq0  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  ( ( X  .-  Y )  =  .0.  <->  X  =  Y ) )

Proof of Theorem grpsubeq0
StepHypRef Expression
1 grpsubid.b . . . . 5  |-  B  =  ( Base `  G
)
2 eqid 2238 . . . . 5  |-  ( +g  `  G )  =  ( +g  `  G )
3 eqid 2238 . . . . 5  |-  ( invg `  G )  =  ( invg `  G )
4 grpsubid.m . . . . 5  |-  .-  =  ( -g `  G )
51, 2, 3, 4grpsubval 13851 . . . 4  |-  ( ( X  e.  B  /\  Y  e.  B )  ->  ( X  .-  Y
)  =  ( X ( +g  `  G
) ( ( invg `  G ) `
 Y ) ) )
653adant1 1046 . . 3  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  ( X  .-  Y
)  =  ( X ( +g  `  G
) ( ( invg `  G ) `
 Y ) ) )
76eqeq1d 2247 . 2  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  ( ( X  .-  Y )  =  .0.  <->  ( X ( +g  `  G
) ( ( invg `  G ) `
 Y ) )  =  .0.  ) )
8 simp1 1028 . . 3  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  G  e.  Grp )
91, 3grpinvcl 13853 . . . 4  |-  ( ( G  e.  Grp  /\  Y  e.  B )  ->  ( ( invg `  G ) `  Y
)  e.  B )
1093adant2 1047 . . 3  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  ( ( invg `  G ) `  Y
)  e.  B )
11 simp2 1029 . . 3  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  X  e.  B )
12 grpsubid.o . . . 4  |-  .0.  =  ( 0g `  G )
131, 2, 12, 3grpinvid2 13858 . . 3  |-  ( ( G  e.  Grp  /\  ( ( invg `  G ) `  Y
)  e.  B  /\  X  e.  B )  ->  ( ( ( invg `  G ) `
 ( ( invg `  G ) `
 Y ) )  =  X  <->  ( X
( +g  `  G ) ( ( invg `  G ) `  Y
) )  =  .0.  ) )
148, 10, 11, 13syl3anc 1278 . 2  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  ( ( ( invg `  G ) `
 ( ( invg `  G ) `
 Y ) )  =  X  <->  ( X
( +g  `  G ) ( ( invg `  G ) `  Y
) )  =  .0.  ) )
151, 3grpinvinv 13872 . . . . 5  |-  ( ( G  e.  Grp  /\  Y  e.  B )  ->  ( ( invg `  G ) `  (
( invg `  G ) `  Y
) )  =  Y )
16153adant2 1047 . . . 4  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  ( ( invg `  G ) `  (
( invg `  G ) `  Y
) )  =  Y )
1716eqeq1d 2247 . . 3  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  ( ( ( invg `  G ) `
 ( ( invg `  G ) `
 Y ) )  =  X  <->  Y  =  X ) )
18 eqcom 2240 . . 3  |-  ( Y  =  X  <->  X  =  Y )
1917, 18bitrdi 196 . 2  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  ( ( ( invg `  G ) `
 ( ( invg `  G ) `
 Y ) )  =  X  <->  X  =  Y ) )
207, 14, 193bitr2d 216 1  |-  ( ( G  e.  Grp  /\  X  e.  B  /\  Y  e.  B )  ->  ( ( X  .-  Y )  =  .0.  <->  X  =  Y ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    <-> wb 105    /\ w3a 1009    = wceq 1402    e. wcel 2209   ` cfv 5377  (class class class)co 6085   Basecbs 13352   +g cplusg 13431   0gc0g 13610   Grpcgrp 13805   invgcminusg 13806   -gcsg 13807
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  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-fal 1408  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-ne 2421  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-dif 3222  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-iun 4014  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-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  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  df-minusg 13809  df-sbg 13810
This theorem is used by:  ghmeqker  14074  ghmf1  14076  kerf1ghm  14077  lmodsubeq0  14683
  Copyright terms: Public domain W3C validator