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

Theorem grpsubeq0 18185
Description: If the difference between two group elements is zero, they are equal. (subeq0 10912 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 2821 . . . . 5 (+g𝐺) = (+g𝐺)
3 eqid 2821 . . . . 5 (invg𝐺) = (invg𝐺)
4 grpsubid.m . . . . 5 = (-g𝐺)
51, 2, 3, 4grpsubval 18149 . . . 4 ((𝑋𝐵𝑌𝐵) → (𝑋 𝑌) = (𝑋(+g𝐺)((invg𝐺)‘𝑌)))
653adant1 1126 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → (𝑋 𝑌) = (𝑋(+g𝐺)((invg𝐺)‘𝑌)))
76eqeq1d 2823 . 2 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → ((𝑋 𝑌) = 0 ↔ (𝑋(+g𝐺)((invg𝐺)‘𝑌)) = 0 ))
8 simp1 1132 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → 𝐺 ∈ Grp)
91, 3grpinvcl 18151 . . . 4 ((𝐺 ∈ Grp ∧ 𝑌𝐵) → ((invg𝐺)‘𝑌) ∈ 𝐵)
1093adant2 1127 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → ((invg𝐺)‘𝑌) ∈ 𝐵)
11 simp2 1133 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → 𝑋𝐵)
12 grpsubid.o . . . 4 0 = (0g𝐺)
131, 2, 12, 3grpinvid2 18155 . . 3 ((𝐺 ∈ Grp ∧ ((invg𝐺)‘𝑌) ∈ 𝐵𝑋𝐵) → (((invg𝐺)‘((invg𝐺)‘𝑌)) = 𝑋 ↔ (𝑋(+g𝐺)((invg𝐺)‘𝑌)) = 0 ))
148, 10, 11, 13syl3anc 1367 . 2 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → (((invg𝐺)‘((invg𝐺)‘𝑌)) = 𝑋 ↔ (𝑋(+g𝐺)((invg𝐺)‘𝑌)) = 0 ))
151, 3grpinvinv 18166 . . . . 5 ((𝐺 ∈ Grp ∧ 𝑌𝐵) → ((invg𝐺)‘((invg𝐺)‘𝑌)) = 𝑌)
16153adant2 1127 . . . 4 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → ((invg𝐺)‘((invg𝐺)‘𝑌)) = 𝑌)
1716eqeq1d 2823 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → (((invg𝐺)‘((invg𝐺)‘𝑌)) = 𝑋𝑌 = 𝑋))
18 eqcom 2828 . . 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 1537  wcel 2114  cfv 6355  (class class class)co 7156  Basecbs 16483  +gcplusg 16565  0gc0g 16713  Grpcgrp 18103  invgcminusg 18104  -gcsg 18105
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-fv 6363  df-riota 7114  df-ov 7159  df-oprab 7160  df-mpo 7161  df-1st 7689  df-2nd 7690  df-0g 16715  df-mgm 17852  df-sgrp 17901  df-mnd 17912  df-grp 18106  df-minusg 18107  df-sbg 18108
This theorem is referenced by:  ghmeqker  18385  ghmf1  18387  odcong  18677  subgdisj1  18817  dprdf11  19145  kerf1ghm  19497  kerf1hrmOLD  19498  lmodsubeq0  19693  lvecvscan2  19884  ip2eq  20797  mdetuni0  21230  tgphaus  22725  nrmmetd  23184  ply1divmo  24729  dvdsq1p  24754  dvdsr1p  24755  ply1remlem  24756  ig1peu  24765  dchr2sum  25849  linds2eq  30941  eqlkr  36250  hdmap11  38999  hdmapinvlem4  39072  idomrootle  39815  lidldomn1  44212
  Copyright terms: Public domain W3C validator