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

Theorem ablsubsub4 19684
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 19651 . . . . 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 18886 . . . 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 18851 . . 3 (((𝑋 𝑌) ∈ 𝐵𝑍𝐵) → ((𝑋 𝑌) 𝑍) = ((𝑋 𝑌) + ((invg𝐺)‘𝑍)))
149, 10, 13syl2anc 584 . 2 (𝜑 → ((𝑋 𝑌) 𝑍) = ((𝑋 𝑌) + ((invg𝐺)‘𝑍)))
156, 12grpinvcl 18853 . . . 4 ((𝐺 ∈ Grp ∧ 𝑍𝐵) → ((invg𝐺)‘𝑍) ∈ 𝐵)
163, 10, 15syl2anc 584 . . 3 (𝜑 → ((invg𝐺)‘𝑍) ∈ 𝐵)
176, 11, 7, 1, 4, 5, 16ablsubsub 19683 . 2 (𝜑 → (𝑋 (𝑌 ((invg𝐺)‘𝑍))) = ((𝑋 𝑌) + ((invg𝐺)‘𝑍)))
186, 11, 7, 12, 3, 5, 10grpsubinv 18878 . . 3 (𝜑 → (𝑌 ((invg𝐺)‘𝑍)) = (𝑌 + 𝑍))
1918oveq2d 7356 . 2 (𝜑 → (𝑋 (𝑌 ((invg𝐺)‘𝑍))) = (𝑋 (𝑌 + 𝑍)))
2014, 17, 193eqtr2d 2770 1 (𝜑 → ((𝑋 𝑌) 𝑍) = (𝑋 (𝑌 + 𝑍)))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1540  wcel 2109  cfv 6476  (class class class)co 7340  Basecbs 17107  +gcplusg 17148  Grpcgrp 18799  invgcminusg 18800  -gcsg 18801  Abelcabl 19647
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 5231  ax-nul 5241  ax-pow 5300  ax-pr 5367  ax-un 7662
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 3343  df-reu 3344  df-rab 3393  df-v 3435  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-iun 4940  df-br 5089  df-opab 5151  df-mpt 5170  df-id 5508  df-xp 5619  df-rel 5620  df-cnv 5621  df-co 5622  df-dm 5623  df-rn 5624  df-res 5625  df-ima 5626  df-iota 6432  df-fun 6478  df-fn 6479  df-f 6480  df-fv 6484  df-riota 7297  df-ov 7343  df-oprab 7344  df-mpo 7345  df-1st 7915  df-2nd 7916  df-0g 17332  df-mgm 18501  df-sgrp 18580  df-mnd 18596  df-grp 18802  df-minusg 18803  df-sbg 18804  df-cmn 19648  df-abl 19649
This theorem is referenced by:  ablsub32  19687  ablnnncan  19688  rngqiprngfulem4  21205  ip2subdi  21535  cpmadugsumlemF  22745  baerlem5alem2  41707
  Copyright terms: Public domain W3C validator