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

Theorem grpsubeq0 18188
Description: If the difference between two group elements is zero, they are equal. (subeq0 10915 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 2824 . . . . 5 (+g𝐺) = (+g𝐺)
3 eqid 2824 . . . . 5 (invg𝐺) = (invg𝐺)
4 grpsubid.m . . . . 5 = (-g𝐺)
51, 2, 3, 4grpsubval 18152 . . . 4 ((𝑋𝐵𝑌𝐵) → (𝑋 𝑌) = (𝑋(+g𝐺)((invg𝐺)‘𝑌)))
653adant1 1126 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → (𝑋 𝑌) = (𝑋(+g𝐺)((invg𝐺)‘𝑌)))
76eqeq1d 2826 . 2 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → ((𝑋 𝑌) = 0 ↔ (𝑋(+g𝐺)((invg𝐺)‘𝑌)) = 0 ))
8 simp1 1132 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → 𝐺 ∈ Grp)
91, 3grpinvcl 18154 . . . 4 ((𝐺 ∈ Grp ∧ 𝑌𝐵) → ((invg𝐺)‘𝑌) ∈ 𝐵)
1093adant2 1127 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → ((invg𝐺)‘𝑌) ∈ 𝐵)
11 simp2 1133 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → 𝑋𝐵)
12 grpsubid.o . . . 4 0 = (0g𝐺)
131, 2, 12, 3grpinvid2 18158 . . 3 ((𝐺 ∈ Grp ∧ ((invg𝐺)‘𝑌) ∈ 𝐵𝑋𝐵) → (((invg𝐺)‘((invg𝐺)‘𝑌)) = 𝑋 ↔ (𝑋(+g𝐺)((invg𝐺)‘𝑌)) = 0 ))
148, 10, 11, 13syl3anc 1367 . 2 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → (((invg𝐺)‘((invg𝐺)‘𝑌)) = 𝑋 ↔ (𝑋(+g𝐺)((invg𝐺)‘𝑌)) = 0 ))
151, 3grpinvinv 18169 . . . . 5 ((𝐺 ∈ Grp ∧ 𝑌𝐵) → ((invg𝐺)‘((invg𝐺)‘𝑌)) = 𝑌)
16153adant2 1127 . . . 4 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → ((invg𝐺)‘((invg𝐺)‘𝑌)) = 𝑌)
1716eqeq1d 2826 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → (((invg𝐺)‘((invg𝐺)‘𝑌)) = 𝑋𝑌 = 𝑋))
18 eqcom 2831 . . 3 (𝑌 = 𝑋𝑋 = 𝑌)
1917, 18syl6bb 289 . 2 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → (((invg𝐺)‘((invg𝐺)‘𝑌)) = 𝑋𝑋 = 𝑌))
207, 14, 193bitr2d 309 1 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → ((𝑋 𝑌) = 0𝑋 = 𝑌))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  w3a 1083   = wceq 1536  wcel 2113  cfv 6358  (class class class)co 7159  Basecbs 16486  +gcplusg 16568  0gc0g 16716  Grpcgrp 18106  invgcminusg 18107  -gcsg 18108
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pow 5269  ax-pr 5333  ax-un 7464
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-ral 3146  df-rex 3147  df-reu 3148  df-rmo 3149  df-rab 3150  df-v 3499  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-pw 4544  df-sn 4571  df-pr 4573  df-op 4577  df-uni 4842  df-iun 4924  df-br 5070  df-opab 5132  df-mpt 5150  df-id 5463  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-fv 6366  df-riota 7117  df-ov 7162  df-oprab 7163  df-mpo 7164  df-1st 7692  df-2nd 7693  df-0g 16718  df-mgm 17855  df-sgrp 17904  df-mnd 17915  df-grp 18109  df-minusg 18110  df-sbg 18111
This theorem is referenced by:  ghmeqker  18388  ghmf1  18390  odcong  18680  subgdisj1  18820  dprdf11  19148  kerf1ghm  19500  kerf1hrmOLD  19501  lmodsubeq0  19696  lvecvscan2  19887  ip2eq  20800  mdetuni0  21233  tgphaus  22728  nrmmetd  23187  ply1divmo  24732  dvdsq1p  24757  dvdsr1p  24758  ply1remlem  24759  ig1peu  24768  dchr2sum  25852  linds2eq  30945  eqlkr  36239  hdmap11  38988  hdmapinvlem4  39061  idomrootle  39801  lidldomn1  44199
  Copyright terms: Public domain W3C validator