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

Theorem ablsubsub4 19793
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 19760 . . . . 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 18996 . . . 4 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → (𝑋 𝑌) ∈ 𝐵)
93, 4, 5, 8syl3anc 1374 . . 3 (𝜑 → (𝑋 𝑌) ∈ 𝐵)
10 ablsubsub.z . . 3 (𝜑𝑍𝐵)
11 ablsubadd.p . . . 4 + = (+g𝐺)
12 eqid 2736 . . . 4 (invg𝐺) = (invg𝐺)
136, 11, 12, 7grpsubval 18961 . . 3 (((𝑋 𝑌) ∈ 𝐵𝑍𝐵) → ((𝑋 𝑌) 𝑍) = ((𝑋 𝑌) + ((invg𝐺)‘𝑍)))
149, 10, 13syl2anc 585 . 2 (𝜑 → ((𝑋 𝑌) 𝑍) = ((𝑋 𝑌) + ((invg𝐺)‘𝑍)))
156, 12grpinvcl 18963 . . . 4 ((𝐺 ∈ Grp ∧ 𝑍𝐵) → ((invg𝐺)‘𝑍) ∈ 𝐵)
163, 10, 15syl2anc 585 . . 3 (𝜑 → ((invg𝐺)‘𝑍) ∈ 𝐵)
176, 11, 7, 1, 4, 5, 16ablsubsub 19792 . 2 (𝜑 → (𝑋 (𝑌 ((invg𝐺)‘𝑍))) = ((𝑋 𝑌) + ((invg𝐺)‘𝑍)))
186, 11, 7, 12, 3, 5, 10grpsubinv 18988 . . 3 (𝜑 → (𝑌 ((invg𝐺)‘𝑍)) = (𝑌 + 𝑍))
1918oveq2d 7383 . 2 (𝜑 → (𝑋 (𝑌 ((invg𝐺)‘𝑍))) = (𝑋 (𝑌 + 𝑍)))
2014, 17, 193eqtr2d 2777 1 (𝜑 → ((𝑋 𝑌) 𝑍) = (𝑋 (𝑌 + 𝑍)))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114  cfv 6498  (class class class)co 7367  Basecbs 17179  +gcplusg 17220  Grpcgrp 18909  invgcminusg 18910  -gcsg 18911  Abelcabl 19756
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 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-1st 7942  df-2nd 7943  df-0g 17404  df-mgm 18608  df-sgrp 18687  df-mnd 18703  df-grp 18912  df-minusg 18913  df-sbg 18914  df-cmn 19757  df-abl 19758
This theorem is referenced by:  ablsub32  19796  ablnnncan  19797  rngqiprngfulem4  21312  ip2subdi  21624  cpmadugsumlemF  22841  baerlem5alem2  42157
  Copyright terms: Public domain W3C validator