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

Theorem ablsubsub4 19889
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 19856 . . . . 5 (𝐺 ∈ Abel → 𝐺 ∈ Grp)
31, 2syl 18 . . . 4 (𝜑𝐺 ∈ Grp)
4 ablsubsub.x . . . 4 (𝜑𝑋𝐵)
5 ablsubsub.y . . . 4 (𝜑𝑌𝐵)
6 ablsubadd.b . . . . 5 𝐵 = (Base‘𝐺)
7 ablsubadd.m . . . . 5 = (-g𝐺)
86, 7grpsubcl 19087 . . . 4 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → (𝑋 𝑌) ∈ 𝐵)
93, 4, 5, 8syl3anc 1398 . . 3 (𝜑 → (𝑋 𝑌) ∈ 𝐵)
10 ablsubsub.z . . 3 (𝜑𝑍𝐵)
11 ablsubadd.p . . . 4 + = (+g𝐺)
12 eqid 2763 . . . 4 (invg𝐺) = (invg𝐺)
136, 11, 12, 7grpsubval 19053 . . 3 (((𝑋 𝑌) ∈ 𝐵𝑍𝐵) → ((𝑋 𝑌) 𝑍) = ((𝑋 𝑌) + ((invg𝐺)‘𝑍)))
149, 10, 13syl2anc 595 . 2 (𝜑 → ((𝑋 𝑌) 𝑍) = ((𝑋 𝑌) + ((invg𝐺)‘𝑍)))
156, 12grpinvcl 19055 . . . 4 ((𝐺 ∈ Grp ∧ 𝑍𝐵) → ((invg𝐺)‘𝑍) ∈ 𝐵)
163, 10, 15syl2anc 595 . . 3 (𝜑 → ((invg𝐺)‘𝑍) ∈ 𝐵)
176, 11, 7, 1, 4, 5, 16ablsubsub 19888 . 2 (𝜑 → (𝑋 (𝑌 ((invg𝐺)‘𝑍))) = ((𝑋 𝑌) + ((invg𝐺)‘𝑍)))
186, 11, 7, 12, 3, 5, 10grpsubinv 19079 . . 3 (𝜑 → (𝑌 ((invg𝐺)‘𝑍)) = (𝑌 + 𝑍))
1918oveq2d 7428 . 2 (𝜑 → (𝑋 (𝑌 ((invg𝐺)‘𝑍))) = (𝑋 (𝑌 + 𝑍)))
2014, 17, 193eqtr2d 2804 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  Grpcgrp 19001  invgcminusg 19002  -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:  ablsub32  19892  ablnnncan  19893  rngqiprngfulem4  21435  ip2subdi  21775  cpmadugsumlemF  23014  baerlem5alem2  42466
  Copyright terms: Public domain W3C validator