Theorem abl32 20068

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 20052	. . 3 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ CMnd)
3	1, 2	syl 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‘𝐺)
9	7, 8	cmn32 20065	. 2 ⊢ ((𝐺 ∈ CMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 + 𝑌) + 𝑍) = ((𝑋 + 𝑍) + 𝑌))
10	3, 4, 5, 6, 9	syl13anc 1400	1 ⊢ (𝜑 → ((𝑋 + 𝑌) + 𝑍) = ((𝑋 + 𝑍) + 𝑌))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  +_gcplusg 17472  CMndccmn 20045  Abelcabl 20046

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-12 2216  ax-ext 2735  ax-nul 5266

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-iota 6520  df-fv 6574  df-ov 7454  df-sgrp 18958  df-mnd 18974  df-cmn 20047  df-abl 20048

This theorem is used by:  matunitlindflem1  23049  baerlem5alem1  43031  baerlem5blem1  43032