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

Theorem ablpnpcan 19336
Description: Cancellation law for mixed addition and subtraction. (pnpcan 11190 analog.) (Contributed by NM, 29-May-2015.)
Hypotheses
Ref Expression
ablsubadd.b 𝐵 = (Base‘𝐺)
ablsubadd.p + = (+g𝐺)
ablsubadd.m = (-g𝐺)
ablsubsub.g (𝜑𝐺 ∈ Abel)
ablsubsub.x (𝜑𝑋𝐵)
ablsubsub.y (𝜑𝑌𝐵)
ablsubsub.z (𝜑𝑍𝐵)
ablpnpcan.g (𝜑𝐺 ∈ Abel)
ablpnpcan.x (𝜑𝑋𝐵)
ablpnpcan.y (𝜑𝑌𝐵)
ablpnpcan.z (𝜑𝑍𝐵)
Assertion
Ref Expression
ablpnpcan (𝜑 → ((𝑋 + 𝑌) (𝑋 + 𝑍)) = (𝑌 𝑍))

Proof of Theorem ablpnpcan
StepHypRef Expression
1 ablsubsub.g . . 3 (𝜑𝐺 ∈ Abel)
2 ablsubsub.x . . 3 (𝜑𝑋𝐵)
3 ablsubsub.y . . 3 (𝜑𝑌𝐵)
4 ablsubsub.z . . 3 (𝜑𝑍𝐵)
5 ablsubadd.b . . . 4 𝐵 = (Base‘𝐺)
6 ablsubadd.p . . . 4 + = (+g𝐺)
7 ablsubadd.m . . . 4 = (-g𝐺)
85, 6, 7ablsub4 19329 . . 3 ((𝐺 ∈ Abel ∧ (𝑋𝐵𝑌𝐵) ∧ (𝑋𝐵𝑍𝐵)) → ((𝑋 + 𝑌) (𝑋 + 𝑍)) = ((𝑋 𝑋) + (𝑌 𝑍)))
91, 2, 3, 2, 4, 8syl122anc 1377 . 2 (𝜑 → ((𝑋 + 𝑌) (𝑋 + 𝑍)) = ((𝑋 𝑋) + (𝑌 𝑍)))
10 ablgrp 19306 . . . . 5 (𝐺 ∈ Abel → 𝐺 ∈ Grp)
111, 10syl 17 . . . 4 (𝜑𝐺 ∈ Grp)
12 eqid 2738 . . . . 5 (0g𝐺) = (0g𝐺)
135, 12, 7grpsubid 18574 . . . 4 ((𝐺 ∈ Grp ∧ 𝑋𝐵) → (𝑋 𝑋) = (0g𝐺))
1411, 2, 13syl2anc 583 . . 3 (𝜑 → (𝑋 𝑋) = (0g𝐺))
1514oveq1d 7270 . 2 (𝜑 → ((𝑋 𝑋) + (𝑌 𝑍)) = ((0g𝐺) + (𝑌 𝑍)))
165, 7grpsubcl 18570 . . . 4 ((𝐺 ∈ Grp ∧ 𝑌𝐵𝑍𝐵) → (𝑌 𝑍) ∈ 𝐵)
1711, 3, 4, 16syl3anc 1369 . . 3 (𝜑 → (𝑌 𝑍) ∈ 𝐵)
185, 6, 12grplid 18524 . . 3 ((𝐺 ∈ Grp ∧ (𝑌 𝑍) ∈ 𝐵) → ((0g𝐺) + (𝑌 𝑍)) = (𝑌 𝑍))
1911, 17, 18syl2anc 583 . 2 (𝜑 → ((0g𝐺) + (𝑌 𝑍)) = (𝑌 𝑍))
209, 15, 193eqtrd 2782 1 (𝜑 → ((𝑋 + 𝑌) (𝑋 + 𝑍)) = (𝑌 𝑍))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1539  wcel 2108  cfv 6418  (class class class)co 7255  Basecbs 16840  +gcplusg 16888  0gc0g 17067  Grpcgrp 18492  -gcsg 18494  Abelcabl 19302
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-1st 7804  df-2nd 7805  df-0g 17069  df-mgm 18241  df-sgrp 18290  df-mnd 18301  df-grp 18495  df-minusg 18496  df-sbg 18497  df-cmn 19303  df-abl 19304
This theorem is referenced by:  hdmaprnlem7N  39796
  Copyright terms: Public domain W3C validator