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

Theorem grppnpcan2 18195
Description: Cancellation law for mixed addition and subtraction. (pnpcan2 10928 analog.) (Contributed by NM, 15-Feb-2008.) (Revised by Mario Carneiro, 2-Dec-2014.)
Hypotheses
Ref Expression
grpsubadd.b 𝐵 = (Base‘𝐺)
grpsubadd.p + = (+g𝐺)
grpsubadd.m = (-g𝐺)
Assertion
Ref Expression
grppnpcan2 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 + 𝑍) (𝑌 + 𝑍)) = (𝑋 𝑌))

Proof of Theorem grppnpcan2
StepHypRef Expression
1 simpl 485 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → 𝐺 ∈ Grp)
2 grpsubadd.b . . . . 5 𝐵 = (Base‘𝐺)
3 grpsubadd.p . . . . 5 + = (+g𝐺)
42, 3grpcl 18113 . . . 4 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑍𝐵) → (𝑋 + 𝑍) ∈ 𝐵)
543adant3r2 1179 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (𝑋 + 𝑍) ∈ 𝐵)
6 simpr3 1192 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → 𝑍𝐵)
7 simpr2 1191 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → 𝑌𝐵)
8 grpsubadd.m . . . 4 = (-g𝐺)
92, 3, 8grpsubsub4 18194 . . 3 ((𝐺 ∈ Grp ∧ ((𝑋 + 𝑍) ∈ 𝐵𝑍𝐵𝑌𝐵)) → (((𝑋 + 𝑍) 𝑍) 𝑌) = ((𝑋 + 𝑍) (𝑌 + 𝑍)))
101, 5, 6, 7, 9syl13anc 1368 . 2 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (((𝑋 + 𝑍) 𝑍) 𝑌) = ((𝑋 + 𝑍) (𝑌 + 𝑍)))
112, 3, 8grppncan 18192 . . . 4 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑍𝐵) → ((𝑋 + 𝑍) 𝑍) = 𝑋)
12113adant3r2 1179 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 + 𝑍) 𝑍) = 𝑋)
1312oveq1d 7173 . 2 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (((𝑋 + 𝑍) 𝑍) 𝑌) = (𝑋 𝑌))
1410, 13eqtr3d 2860 1 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 + 𝑍) (𝑌 + 𝑍)) = (𝑋 𝑌))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  w3a 1083   = wceq 1537  wcel 2114  cfv 6357  (class class class)co 7158  Basecbs 16485  +gcplusg 16567  Grpcgrp 18105  -gcsg 18107
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 2795  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463
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 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-fv 6365  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-1st 7691  df-2nd 7692  df-0g 16717  df-mgm 17854  df-sgrp 17903  df-mnd 17914  df-grp 18108  df-minusg 18109  df-sbg 18110
This theorem is referenced by:  ngprcan  23221
  Copyright terms: Public domain W3C validator