MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  grpsubeq0 Structured version   Visualization version   GIF version

Theorem grpsubeq0 18177
Description: If the difference between two group elements is zero, they are equal. (subeq0 10901 analog.) (Contributed by NM, 31-Mar-2014.)
Hypotheses
Ref Expression
grpsubid.b 𝐵 = (Base‘𝐺)
grpsubid.o 0 = (0g𝐺)
grpsubid.m = (-g𝐺)
Assertion
Ref Expression
grpsubeq0 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → ((𝑋 𝑌) = 0𝑋 = 𝑌))

Proof of Theorem grpsubeq0
StepHypRef Expression
1 grpsubid.b . . . . 5 𝐵 = (Base‘𝐺)
2 eqid 2798 . . . . 5 (+g𝐺) = (+g𝐺)
3 eqid 2798 . . . . 5 (invg𝐺) = (invg𝐺)
4 grpsubid.m . . . . 5 = (-g𝐺)
51, 2, 3, 4grpsubval 18141 . . . 4 ((𝑋𝐵𝑌𝐵) → (𝑋 𝑌) = (𝑋(+g𝐺)((invg𝐺)‘𝑌)))
653adant1 1127 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → (𝑋 𝑌) = (𝑋(+g𝐺)((invg𝐺)‘𝑌)))
76eqeq1d 2800 . 2 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → ((𝑋 𝑌) = 0 ↔ (𝑋(+g𝐺)((invg𝐺)‘𝑌)) = 0 ))
8 simp1 1133 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → 𝐺 ∈ Grp)
91, 3grpinvcl 18143 . . . 4 ((𝐺 ∈ Grp ∧ 𝑌𝐵) → ((invg𝐺)‘𝑌) ∈ 𝐵)
1093adant2 1128 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → ((invg𝐺)‘𝑌) ∈ 𝐵)
11 simp2 1134 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → 𝑋𝐵)
12 grpsubid.o . . . 4 0 = (0g𝐺)
131, 2, 12, 3grpinvid2 18147 . . 3 ((𝐺 ∈ Grp ∧ ((invg𝐺)‘𝑌) ∈ 𝐵𝑋𝐵) → (((invg𝐺)‘((invg𝐺)‘𝑌)) = 𝑋 ↔ (𝑋(+g𝐺)((invg𝐺)‘𝑌)) = 0 ))
148, 10, 11, 13syl3anc 1368 . 2 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → (((invg𝐺)‘((invg𝐺)‘𝑌)) = 𝑋 ↔ (𝑋(+g𝐺)((invg𝐺)‘𝑌)) = 0 ))
151, 3grpinvinv 18158 . . . . 5 ((𝐺 ∈ Grp ∧ 𝑌𝐵) → ((invg𝐺)‘((invg𝐺)‘𝑌)) = 𝑌)
16153adant2 1128 . . . 4 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → ((invg𝐺)‘((invg𝐺)‘𝑌)) = 𝑌)
1716eqeq1d 2800 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → (((invg𝐺)‘((invg𝐺)‘𝑌)) = 𝑋𝑌 = 𝑋))
18 eqcom 2805 . . 3 (𝑌 = 𝑋𝑋 = 𝑌)
1917, 18syl6bb 290 . 2 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → (((invg𝐺)‘((invg𝐺)‘𝑌)) = 𝑋𝑋 = 𝑌))
207, 14, 193bitr2d 310 1 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → ((𝑋 𝑌) = 0𝑋 = 𝑌))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  w3a 1084   = wceq 1538  wcel 2111  cfv 6324  (class class class)co 7135  Basecbs 16475  +gcplusg 16557  0gc0g 16705  Grpcgrp 18095  invgcminusg 18096  -gcsg 18097
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-1st 7671  df-2nd 7672  df-0g 16707  df-mgm 17844  df-sgrp 17893  df-mnd 17904  df-grp 18098  df-minusg 18099  df-sbg 18100
This theorem is referenced by:  ghmeqker  18377  ghmf1  18379  odcong  18669  subgdisj1  18809  dprdf11  19138  kerf1ghm  19491  lmodsubeq0  19686  lvecvscan2  19877  ip2eq  20342  mdetuni0  21226  tgphaus  22722  nrmmetd  23181  ply1divmo  24736  dvdsq1p  24761  dvdsr1p  24762  ply1remlem  24763  ig1peu  24772  dchr2sum  25857  linds2eq  30995  eqlkr  36395  hdmap11  39144  hdmapinvlem4  39217  idomrootle  40139  lidldomn1  44545
  Copyright terms: Public domain W3C validator