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

Theorem ablpnpcan 19890
Description: Cancellation law for mixed addition and subtraction. (pnpcan 11498 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 19881 . . 3 ((𝐺 ∈ Abel ∧ (𝑋𝐵𝑌𝐵) ∧ (𝑋𝐵𝑍𝐵)) → ((𝑋 + 𝑌) (𝑋 + 𝑍)) = ((𝑋 𝑋) + (𝑌 𝑍)))
91, 2, 3, 2, 4, 8syl122anc 1406 . 2 (𝜑 → ((𝑋 + 𝑌) (𝑋 + 𝑍)) = ((𝑋 𝑋) + (𝑌 𝑍)))
10 ablgrp 19856 . . . . 5 (𝐺 ∈ Abel → 𝐺 ∈ Grp)
111, 10syl 18 . . . 4 (𝜑𝐺 ∈ Grp)
12 eqid 2763 . . . . 5 (0g𝐺) = (0g𝐺)
135, 12, 7grpsubid 19091 . . . 4 ((𝐺 ∈ Grp ∧ 𝑋𝐵) → (𝑋 𝑋) = (0g𝐺))
1411, 2, 13syl2anc 595 . . 3 (𝜑 → (𝑋 𝑋) = (0g𝐺))
1514oveq1d 7427 . 2 (𝜑 → ((𝑋 𝑋) + (𝑌 𝑍)) = ((0g𝐺) + (𝑌 𝑍)))
165, 7grpsubcl 19087 . . . 4 ((𝐺 ∈ Grp ∧ 𝑌𝐵𝑍𝐵) → (𝑌 𝑍) ∈ 𝐵)
1711, 3, 4, 16syl3anc 1398 . . 3 (𝜑 → (𝑌 𝑍) ∈ 𝐵)
185, 6, 12grplid 19035 . . 3 ((𝐺 ∈ Grp ∧ (𝑌 𝑍) ∈ 𝐵) → ((0g𝐺) + (𝑌 𝑍)) = (𝑌 𝑍))
1911, 17, 18syl2anc 595 . 2 (𝜑 → ((0g𝐺) + (𝑌 𝑍)) = (𝑌 𝑍))
209, 15, 193eqtrd 2802 1 (𝜑 → ((𝑋 + 𝑌) (𝑋 + 𝑍)) = (𝑌 𝑍))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1570  wcel 2143  cfv 6538  (class class class)co 7412  Basecbs 17270  +gcplusg 17311  0gc0g 17493  Grpcgrp 19001  -gcsg 19003  Abelcabl 19852
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7987  df-2nd 7988  df-0g 17495  df-mgm 18699  df-sgrp 18778  df-mnd 18794  df-grp 19004  df-minusg 19005  df-sbg 19006  df-cmn 19853  df-abl 19854
This theorem is referenced by:  hdmaprnlem7N  42610
  Copyright terms: Public domain W3C validator