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

Theorem grpsubeq0 13868
Description: If the difference between two group elements is zero, they are equal. (subeq0 8542 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 13828 . . . 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 13830 . . . 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 13835 . . 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 13849 . . . . 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
Syntax hints:    -> wi 4    <-> wb 105    /\ w3a 1009    = wceq 1402    e. wcel 2209   ` cfv 5372  (class class class)co 6075   Basecbs 13330   +g cplusg 13408   0gc0g 13587   Grpcgrp 13782   invgcminusg 13783   -gcsg 13784
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-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 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  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-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 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-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  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  df-sbg 13787
This theorem is referenced by:  ghmeqker  14051  ghmf1  14053  kerf1ghm  14054  lmodsubeq0  14655
  Copyright terms: Public domain W3C validator