cmn4 - Metamath Proof Explorer

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

Theorem cmn4 18918

Description: Commutative/associative law for Abelian groups. (Contributed by NM, 4-Feb-2014.) (Revised by Mario Carneiro, 21-Apr-2016.)

**Hypotheses**
Ref	Expression
ablcom.b	⊢ 𝐵 = (Base‘𝐺)
ablcom.p	⊢ + = (+_g‘𝐺)

**Assertion**
Ref	Expression
cmn4	⊢ ((𝐺 ∈ CMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑍 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵)) → ((𝑋 + 𝑌) + (𝑍 + 𝑊)) = ((𝑋 + 𝑍) + (𝑌 + 𝑊)))

**Proof of Theorem cmn4**
Step	Hyp	Ref	Expression
1		ablcom.b	. 2 ⊢ 𝐵 = (Base‘𝐺)
2		ablcom.p	. 2 ⊢ + = (+_g‘𝐺)
3		simp1 1133	. . 3 ⊢ ((𝐺 ∈ CMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑍 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵)) → 𝐺 ∈ CMnd)
4		cmnmnd 18914	. . 3 ⊢ (𝐺 ∈ CMnd → 𝐺 ∈ Mnd)
5	3, 4	syl 17	. 2 ⊢ ((𝐺 ∈ CMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑍 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵)) → 𝐺 ∈ Mnd)
6		simp2l 1196	. 2 ⊢ ((𝐺 ∈ CMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑍 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵)) → 𝑋 ∈ 𝐵)
7		simp2r 1197	. 2 ⊢ ((𝐺 ∈ CMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑍 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵)) → 𝑌 ∈ 𝐵)
8		simp3l 1198	. 2 ⊢ ((𝐺 ∈ CMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑍 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵)) → 𝑍 ∈ 𝐵)
9		simp3r 1199	. 2 ⊢ ((𝐺 ∈ CMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑍 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵)) → 𝑊 ∈ 𝐵)
10	1, 2	cmncom 18915	. . 3 ⊢ ((𝐺 ∈ CMnd ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑌 + 𝑍) = (𝑍 + 𝑌))
11	3, 7, 8, 10	syl3anc 1368	. 2 ⊢ ((𝐺 ∈ CMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑍 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵)) → (𝑌 + 𝑍) = (𝑍 + 𝑌))
12	1, 2, 5, 6, 7, 8, 9, 11	mnd4g 17917	1 ⊢ ((𝐺 ∈ CMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑍 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵)) → ((𝑋 + 𝑌) + (𝑍 + 𝑊)) = ((𝑋 + 𝑍) + (𝑌 + 𝑊)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ‘cfv 6324 (class class class)co 7135 Basecbs 16475 +_gcplusg 16557 Mndcmnd 17903 CMndccmn 18898

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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-nul 5174

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-iota 6283 df-fv 6332 df-ov 7138 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-cmn 18900

This theorem is referenced by: ablsub4 18926 ghmplusg 18959 lmod4 19677 ip2di 20330 evlslem1 20754 clmsub4 23711 cringm4 31030 lfladdcl 36367

W3C validator