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

Theorem ablsubsub4 19748
Description: Law for double subtraction. (Contributed by NM, 7-Apr-2015.)
Hypotheses
Ref Expression
ablsubadd.b 𝐵 = (Base‘𝐺)
ablsubadd.p + = (+g𝐺)
ablsubadd.m = (-g𝐺)
ablsubsub.g (𝜑𝐺 ∈ Abel)
ablsubsub.x (𝜑𝑋𝐵)
ablsubsub.y (𝜑𝑌𝐵)
ablsubsub.z (𝜑𝑍𝐵)
Assertion
Ref Expression
ablsubsub4 (𝜑 → ((𝑋 𝑌) 𝑍) = (𝑋 (𝑌 + 𝑍)))

Proof of Theorem ablsubsub4
StepHypRef Expression
1 ablsubsub.g . . . . 5 (𝜑𝐺 ∈ Abel)
2 ablgrp 19715 . . . . 5 (𝐺 ∈ Abel → 𝐺 ∈ Grp)
31, 2syl 17 . . . 4 (𝜑𝐺 ∈ Grp)
4 ablsubsub.x . . . 4 (𝜑𝑋𝐵)
5 ablsubsub.y . . . 4 (𝜑𝑌𝐵)
6 ablsubadd.b . . . . 5 𝐵 = (Base‘𝐺)
7 ablsubadd.m . . . . 5 = (-g𝐺)
86, 7grpsubcl 18952 . . . 4 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → (𝑋 𝑌) ∈ 𝐵)
93, 4, 5, 8syl3anc 1373 . . 3 (𝜑 → (𝑋 𝑌) ∈ 𝐵)
10 ablsubsub.z . . 3 (𝜑𝑍𝐵)
11 ablsubadd.p . . . 4 + = (+g𝐺)
12 eqid 2729 . . . 4 (invg𝐺) = (invg𝐺)
136, 11, 12, 7grpsubval 18917 . . 3 (((𝑋 𝑌) ∈ 𝐵𝑍𝐵) → ((𝑋 𝑌) 𝑍) = ((𝑋 𝑌) + ((invg𝐺)‘𝑍)))
149, 10, 13syl2anc 584 . 2 (𝜑 → ((𝑋 𝑌) 𝑍) = ((𝑋 𝑌) + ((invg𝐺)‘𝑍)))
156, 12grpinvcl 18919 . . . 4 ((𝐺 ∈ Grp ∧ 𝑍𝐵) → ((invg𝐺)‘𝑍) ∈ 𝐵)
163, 10, 15syl2anc 584 . . 3 (𝜑 → ((invg𝐺)‘𝑍) ∈ 𝐵)
176, 11, 7, 1, 4, 5, 16ablsubsub 19747 . 2 (𝜑 → (𝑋 (𝑌 ((invg𝐺)‘𝑍))) = ((𝑋 𝑌) + ((invg𝐺)‘𝑍)))
186, 11, 7, 12, 3, 5, 10grpsubinv 18944 . . 3 (𝜑 → (𝑌 ((invg𝐺)‘𝑍)) = (𝑌 + 𝑍))
1918oveq2d 7403 . 2 (𝜑 → (𝑋 (𝑌 ((invg𝐺)‘𝑍))) = (𝑋 (𝑌 + 𝑍)))
2014, 17, 193eqtr2d 2770 1 (𝜑 → ((𝑋 𝑌) 𝑍) = (𝑋 (𝑌 + 𝑍)))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1540  wcel 2109  cfv 6511  (class class class)co 7387  Basecbs 17179  +gcplusg 17220  Grpcgrp 18865  invgcminusg 18866  -gcsg 18867  Abelcabl 19711
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-fv 6519  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-1st 7968  df-2nd 7969  df-0g 17404  df-mgm 18567  df-sgrp 18646  df-mnd 18662  df-grp 18868  df-minusg 18869  df-sbg 18870  df-cmn 19712  df-abl 19713
This theorem is referenced by:  ablsub32  19751  ablnnncan  19752  rngqiprngfulem4  21224  ip2subdi  21553  cpmadugsumlemF  22763  baerlem5alem2  41705
  Copyright terms: Public domain W3C validator