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

Theorem grpsubadd 19267
Description: Relationship between group subtraction and addition. (Contributed by NM, 31-Mar-2014.)
Hypotheses
Ref Expression
grpsubadd.b 𝐵 = (Base‘𝐺)
grpsubadd.p + = (+g‘𝐺)
grpsubadd.m − = (-g‘𝐺)
Assertion
Ref Expression
grpsubadd ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 − 𝑌) = 𝑍 ↔ (𝑍 + 𝑌) = 𝑋))

Proof of Theorem grpsubadd
StepHypRef Expression
1 grpsubadd.b . . . . . . 7 𝐵 = (Base‘𝐺)
2 grpsubadd.p . . . . . . 7 + = (+g‘𝐺)
3 eqid 2763 . . . . . . 7 (invg‘𝐺) = (invg‘𝐺)
4 grpsubadd.m . . . . . . 7 − = (-g‘𝐺)
51, 2, 3, 4grpsubval 19225 . . . . . 6 ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋 + ((invg‘𝐺)‘𝑌)))
653adant3 1150 . . . . 5 ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋 + ((invg‘𝐺)‘𝑌)))
76adantl 487 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 − 𝑌) = (𝑋 + ((invg‘𝐺)‘𝑌)))
87eqeq1d 2765 . . 3 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 − 𝑌) = 𝑍 ↔ (𝑋 + ((invg‘𝐺)‘𝑌)) = 𝑍))
9 simpl 488 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝐺 ∈ Grp)
10 simpr1 1213 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝑋 ∈ 𝐵)
111, 3grpinvcl 19227 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘𝑌) ∈ 𝐵)
12113ad2antr2 1208 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((invg‘𝐺)‘𝑌) ∈ 𝐵)
131, 2grpcl 19181 . . . . 5 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ ((invg‘𝐺)‘𝑌) ∈ 𝐵) → (𝑋 + ((invg‘𝐺)‘𝑌)) ∈ 𝐵)
149, 10, 12, 13syl3anc 1399 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 + ((invg‘𝐺)‘𝑌)) ∈ 𝐵)
15 simpr3 1215 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝑍 ∈ 𝐵)
16 simpr2 1214 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝑌 ∈ 𝐵)
171, 2grprcan 19213 . . . 4 ((𝐺 ∈ Grp ∧ ((𝑋 + ((invg‘𝐺)‘𝑌)) ∈ 𝐵 ∧ 𝑍 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (((𝑋 + ((invg‘𝐺)‘𝑌)) + 𝑌) = (𝑍 + 𝑌) ↔ (𝑋 + ((invg‘𝐺)‘𝑌)) = 𝑍))
189, 14, 15, 16, 17syl13anc 1400 . . 3 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (((𝑋 + ((invg‘𝐺)‘𝑌)) + 𝑌) = (𝑍 + 𝑌) ↔ (𝑋 + ((invg‘𝐺)‘𝑌)) = 𝑍))
191, 2grpass 19182 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ ((invg‘𝐺)‘𝑌) ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑋 + ((invg‘𝐺)‘𝑌)) + 𝑌) = (𝑋 + (((invg‘𝐺)‘𝑌) + 𝑌)))
209, 10, 12, 16, 19syl13anc 1400 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 + ((invg‘𝐺)‘𝑌)) + 𝑌) = (𝑋 + (((invg‘𝐺)‘𝑌) + 𝑌)))
21 eqid 2763 . . . . . . . 8 (0g‘𝐺) = (0g‘𝐺)
221, 2, 21, 3grplinv 19229 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (((invg‘𝐺)‘𝑌) + 𝑌) = (0g‘𝐺))
23223ad2antr2 1208 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (((invg‘𝐺)‘𝑌) + 𝑌) = (0g‘𝐺))
2423oveq2d 7459 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 + (((invg‘𝐺)‘𝑌) + 𝑌)) = (𝑋 + (0g‘𝐺)))
251, 2, 21grprid 19208 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 + (0g‘𝐺)) = 𝑋)
26253ad2antr1 1207 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 + (0g‘𝐺)) = 𝑋)
2720, 24, 263eqtrd 2802 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 + ((invg‘𝐺)‘𝑌)) + 𝑌) = 𝑋)
2827eqeq1d 2765 . . 3 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (((𝑋 + ((invg‘𝐺)‘𝑌)) + 𝑌) = (𝑍 + 𝑌) ↔ 𝑋 = (𝑍 + 𝑌)))
298, 18, 283bitr2d 310 . 2 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 − 𝑌) = 𝑍 ↔ 𝑋 = (𝑍 + 𝑌)))
30 eqcom 2770 . 2 (𝑋 = (𝑍 + 𝑌) ↔ (𝑍 + 𝑌) = 𝑋)
3129, 30bitrdi 290 1 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 − 𝑌) = 𝑍 ↔ (𝑍 + 𝑌) = 𝑋))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ‘cfv 6558  (class class class)co 7443  Basecbs 17416  +gcplusg 17457  0gc0g 17639  Grpcgrp 19173  invgcminusg 19174  -gcsg 19175
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-fv 6566  df-riota 7400  df-ov 7446  df-oprab 7447  df-mpo 7448  df-1st 8025  df-2nd 8026  df-0g 17641  df-mgm 18845  df-sgrp 18937  df-mnd 18953  df-grp 19176  df-minusg 19177  df-sbg 19178
This theorem is used by:  grpsubsub4  19272  xpsgrpsub  19300  conjghm  19492  conjnmzb  19496  sylow3lem2  19872  ablsubadd  20053  ablsubsub23  20068  pgpfac1lem2  20321  pgpfac1lem4  20324  lspexch  21437  ipsubdir  21978  ipsubdi  21979  coe1subfv  22615  dflring2  34095  lindsunlem  34326  zlmodzxzsub  49677
  Copyright terms: Public domain W3C validator