Theorem abl32 19732

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

Step	Hyp	Ref	Expression
1		abl32.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ Abel)
2		ablcmn 19716	. . 3 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ CMnd)
3	1, 2	syl 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‘𝐺)
9	7, 8	cmn32 19729	. 2 ⊢ ((𝐺 ∈ CMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 + 𝑌) + 𝑍) = ((𝑋 + 𝑍) + 𝑌))
10	3, 4, 5, 6, 9	syl13anc 1374	1 ⊢ (𝜑 → ((𝑋 + 𝑌) + 𝑍) = ((𝑋 + 𝑍) + 𝑌))

Syntax hints:   → wi 4   = wceq 1541   ∈ wcel 2113  ‘cfv 6492  (class class class)co 7358  Basecbs 17136  +_gcplusg 17177  CMndccmn 19709  Abelcabl 19710

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-12 2184  ax-ext 2708  ax-nul 5251

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-sbc 3741  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-iota 6448  df-fv 6500  df-ov 7361  df-sgrp 18644  df-mnd 18660  df-cmn 19711  df-abl 19712

This theorem is referenced by:  matunitlindflem1  37817  baerlem5alem1  41968  baerlem5blem1  41969