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

Theorem abl32 19769
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 19753 . . 3 (𝐺 ∈ Abel → 𝐺 ∈ CMnd)
31, 2syl 17 . 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 19766 . 2 ((𝐺 ∈ CMnd ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 + 𝑌) + 𝑍) = ((𝑋 + 𝑍) + 𝑌))
103, 4, 5, 6, 9syl13anc 1375 1 (𝜑 → ((𝑋 + 𝑌) + 𝑍) = ((𝑋 + 𝑍) + 𝑌))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114  cfv 6492  (class class class)co 7360  Basecbs 17170  +gcplusg 17211  CMndccmn 19746  Abelcabl 19747
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-12 2185  ax-ext 2709  ax-nul 5241
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-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-iota 6448  df-fv 6500  df-ov 7363  df-sgrp 18678  df-mnd 18694  df-cmn 19748  df-abl 19749
This theorem is referenced by:  matunitlindflem1  37951  baerlem5alem1  42168  baerlem5blem1  42169
  Copyright terms: Public domain W3C validator