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

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

Proof of Theorem grppnpcan2
StepHypRef Expression
1 simpl 486 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → 𝐺 ∈ Grp)
2 grpsubadd.b . . . . 5 𝐵 = (Base‘𝐺)
3 grpsubadd.p . . . . 5 + = (+g𝐺)
42, 3grpcl 18109 . . . 4 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑍𝐵) → (𝑋 + 𝑍) ∈ 𝐵)
543adant3r2 1180 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (𝑋 + 𝑍) ∈ 𝐵)
6 simpr3 1193 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → 𝑍𝐵)
7 simpr2 1192 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → 𝑌𝐵)
8 grpsubadd.m . . . 4 = (-g𝐺)
92, 3, 8grpsubsub4 18190 . . 3 ((𝐺 ∈ Grp ∧ ((𝑋 + 𝑍) ∈ 𝐵𝑍𝐵𝑌𝐵)) → (((𝑋 + 𝑍) 𝑍) 𝑌) = ((𝑋 + 𝑍) (𝑌 + 𝑍)))
101, 5, 6, 7, 9syl13anc 1369 . 2 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (((𝑋 + 𝑍) 𝑍) 𝑌) = ((𝑋 + 𝑍) (𝑌 + 𝑍)))
112, 3, 8grppncan 18188 . . . 4 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑍𝐵) → ((𝑋 + 𝑍) 𝑍) = 𝑋)
12113adant3r2 1180 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 + 𝑍) 𝑍) = 𝑋)
1312oveq1d 7161 . 2 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (((𝑋 + 𝑍) 𝑍) 𝑌) = (𝑋 𝑌))
1410, 13eqtr3d 2861 1 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 + 𝑍) (𝑌 + 𝑍)) = (𝑋 𝑌))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2115  ‘cfv 6344  (class class class)co 7146  Basecbs 16481  +gcplusg 16563  Grpcgrp 18101  -gcsg 18103 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 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796  ax-sep 5190  ax-nul 5197  ax-pow 5254  ax-pr 5318  ax-un 7452 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 2071  df-mo 2624  df-eu 2655  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ne 3015  df-ral 3138  df-rex 3139  df-reu 3140  df-rmo 3141  df-rab 3142  df-v 3482  df-sbc 3759  df-csb 3867  df-dif 3922  df-un 3924  df-in 3926  df-ss 3936  df-nul 4277  df-if 4451  df-pw 4524  df-sn 4551  df-pr 4553  df-op 4557  df-uni 4826  df-iun 4908  df-br 5054  df-opab 5116  df-mpt 5134  df-id 5448  df-xp 5549  df-rel 5550  df-cnv 5551  df-co 5552  df-dm 5553  df-rn 5554  df-res 5555  df-ima 5556  df-iota 6303  df-fun 6346  df-fn 6347  df-f 6348  df-fv 6352  df-riota 7104  df-ov 7149  df-oprab 7150  df-mpo 7151  df-1st 7681  df-2nd 7682  df-0g 16713  df-mgm 17850  df-sgrp 17899  df-mnd 17910  df-grp 18104  df-minusg 18105  df-sbg 18106 This theorem is referenced by:  ngprcan  23214
 Copyright terms: Public domain W3C validator