Theorem mnd4g 18953

Description: Commutative/associative law for commutative monoids, with an explicit commutativity hypothesis. (Contributed by Mario Carneiro, 21-Apr-2016.)

Hypotheses

Ref	Expression
mndcl.b	⊢ 𝐵 = (Base‘𝐺)
mndcl.p	⊢ + = (+g‘𝐺)
mnd4g.1	⊢ (𝜑 → 𝐺 ∈ Mnd)
mnd4g.2	⊢ (𝜑 → 𝑋 ∈ 𝐵)
mnd4g.3	⊢ (𝜑 → 𝑌 ∈ 𝐵)
mnd4g.4	⊢ (𝜑 → 𝑍 ∈ 𝐵)
mnd4g.5	⊢ (𝜑 → 𝑊 ∈ 𝐵)
mnd4g.6	⊢ (𝜑 → (𝑌 + 𝑍) = (𝑍 + 𝑌))

Assertion

Ref	Expression
mnd4g	⊢ (𝜑 → ((𝑋 + 𝑌) + (𝑍 + 𝑊)) = ((𝑋 + 𝑍) + (𝑌 + 𝑊)))

Proof of Theorem mnd4g

Step	Hyp	Ref	Expression
1		mndcl.b	. . . 4 ⊢ 𝐵 = (Base‘𝐺)
2		mndcl.p	. . . 4 ⊢ + = (+g‘𝐺)
3		mnd4g.1	. . . 4 ⊢ (𝜑 → 𝐺 ∈ Mnd)
4		mnd4g.3	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
5		mnd4g.4	. . . 4 ⊢ (𝜑 → 𝑍 ∈ 𝐵)
6		mnd4g.5	. . . 4 ⊢ (𝜑 → 𝑊 ∈ 𝐵)
7		mnd4g.6	. . . 4 ⊢ (𝜑 → (𝑌 + 𝑍) = (𝑍 + 𝑌))
8	1, 2, 3, 4, 5, 6, 7	mnd12g 18952	. . 3 ⊢ (𝜑 → (𝑌 + (𝑍 + 𝑊)) = (𝑍 + (𝑌 + 𝑊)))
9	8	oveq2d 7446	. 2 ⊢ (𝜑 → (𝑋 + (𝑌 + (𝑍 + 𝑊))) = (𝑋 + (𝑍 + (𝑌 + 𝑊))))
10		mnd4g.2	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
11	1, 2	mndcl 18946	. . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑍 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) → (𝑍 + 𝑊) ∈ 𝐵)
12	3, 5, 6, 11	syl3anc 1398	. . 3 ⊢ (𝜑 → (𝑍 + 𝑊) ∈ 𝐵)
13	1, 2	mndass 18947	. . 3 ⊢ ((𝐺 ∈ Mnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ (𝑍 + 𝑊) ∈ 𝐵)) → ((𝑋 + 𝑌) + (𝑍 + 𝑊)) = (𝑋 + (𝑌 + (𝑍 + 𝑊))))
14	3, 10, 4, 12, 13	syl13anc 1399	. 2 ⊢ (𝜑 → ((𝑋 + 𝑌) + (𝑍 + 𝑊)) = (𝑋 + (𝑌 + (𝑍 + 𝑊))))
15	1, 2	mndcl 18946	. . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑌 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) → (𝑌 + 𝑊) ∈ 𝐵)
16	3, 4, 6, 15	syl3anc 1398	. . 3 ⊢ (𝜑 → (𝑌 + 𝑊) ∈ 𝐵)
17	1, 2	mndass 18947	. . 3 ⊢ ((𝐺 ∈ Mnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵 ∧ (𝑌 + 𝑊) ∈ 𝐵)) → ((𝑋 + 𝑍) + (𝑌 + 𝑊)) = (𝑋 + (𝑍 + (𝑌 + 𝑊))))
18	3, 10, 5, 16, 17	syl13anc 1399	. 2 ⊢ (𝜑 → ((𝑋 + 𝑍) + (𝑌 + 𝑊)) = (𝑋 + (𝑍 + (𝑌 + 𝑊))))
19	9, 14, 18	3eqtr4d 2808	1 ⊢ (𝜑 → ((𝑋 + 𝑌) + (𝑍 + 𝑊)) = ((𝑋 + 𝑍) + (𝑌 + 𝑊)))

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2146  ‘cfv 6547  (class class class)co 7430  Basecbs 17402  +_gcplusg 17443  Mndcmnd 18938

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-nul 5263

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  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-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-iota 6501  df-fv 6555  df-ov 7433  df-mgm 18831  df-sgrp 18923  df-mnd 18939

This theorem is used by:  lsmsubm  19882  pj1ghm  19932  cmn4  20030  gsumzaddlem  20150