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

Theorem abl32 19874
Description: Commutative/associative law for Abelian groups. (Contributed by Stefan O'Rear, 10-Apr-2015.) (Revised by Mario Carneiro, 21-Apr-2016.)
Hypotheses
Ref Expression
ablcom.b 𝐵 = (Base‘𝐺)
ablcom.p + = (+g𝐺)
abl32.g (𝜑𝐺 ∈ Abel)
abl32.x (𝜑𝑋𝐵)
abl32.y (𝜑𝑌𝐵)
abl32.z (𝜑𝑍𝐵)
Assertion
Ref Expression
abl32 (𝜑 → ((𝑋 + 𝑌) + 𝑍) = ((𝑋 + 𝑍) + 𝑌))

Proof of Theorem abl32
StepHypRef Expression
1 abl32.g . . 3 (𝜑𝐺 ∈ Abel)
2 ablcmn 19858 . . 3 (𝐺 ∈ Abel → 𝐺 ∈ CMnd)
31, 2syl 18 . 2 (𝜑𝐺 ∈ CMnd)
4 abl32.x . 2 (𝜑𝑋𝐵)
5 abl32.y . 2 (𝜑𝑌𝐵)
6 abl32.z . 2 (𝜑𝑍𝐵)
7 ablcom.b . . 3 𝐵 = (Base‘𝐺)
8 ablcom.p . . 3 + = (+g𝐺)
97, 8cmn32 19871 . 2 ((𝐺 ∈ CMnd ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 + 𝑌) + 𝑍) = ((𝑋 + 𝑍) + 𝑌))
103, 4, 5, 6, 9syl13anc 1399 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  CMndccmn 19851  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-12 2213  ax-ext 2735  ax-nul 5270
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-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3746  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-br 5111  df-iota 6494  df-fv 6546  df-ov 7415  df-sgrp 18778  df-mnd 18794  df-cmn 19853  df-abl 19854
This theorem is referenced by:  matunitlindflem1  38248  baerlem5alem1  42463  baerlem5blem1  42464
  Copyright terms: Public domain W3C validator