Metamath Proof Explorer

Theorem mnd32g

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

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

Proof

Step Hyp Ref Expression
1 mndcl.b ⊢ 𝐵 = ( Base ‘ 𝐺 )
2 mndcl.p ⊢ + = ( +g ‘ 𝐺 )
3 mnd4g.1 ⊢ ( 𝜑 → 𝐺 ∈ Mnd )
4 mnd4g.2 ⊢ ( 𝜑 → 𝑋 ∈ 𝐵 )
5 mnd4g.3 ⊢ ( 𝜑 → 𝑌 ∈ 𝐵 )
6 mnd4g.4 ⊢ ( 𝜑 → 𝑍 ∈ 𝐵 )
7 mnd32g.5 ⊢ ( 𝜑 → ( 𝑌 + 𝑍 ) = ( 𝑍 + 𝑌 ) )
8 7 oveq2d ⊢ ( 𝜑 → ( 𝑋 + ( 𝑌 + 𝑍 ) ) = ( 𝑋 + ( 𝑍 + 𝑌 ) ) )
9 1 2 mndass ⊢ ( ( 𝐺 ∈ Mnd ∧ ( 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵 ) ) → ( ( 𝑋 + 𝑌 ) + 𝑍 ) = ( 𝑋 + ( 𝑌 + 𝑍 ) ) )
10 3 4 5 6 9 syl13anc ⊢ ( 𝜑 → ( ( 𝑋 + 𝑌 ) + 𝑍 ) = ( 𝑋 + ( 𝑌 + 𝑍 ) ) )
11 1 2 mndass ⊢ ( ( 𝐺 ∈ Mnd ∧ ( 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ) ) → ( ( 𝑋 + 𝑍 ) + 𝑌 ) = ( 𝑋 + ( 𝑍 + 𝑌 ) ) )
12 3 4 6 5 11 syl13anc ⊢ ( 𝜑 → ( ( 𝑋 + 𝑍 ) + 𝑌 ) = ( 𝑋 + ( 𝑍 + 𝑌 ) ) )
13 8 10 12 3eqtr4d ⊢ ( 𝜑 → ( ( 𝑋 + 𝑌 ) + 𝑍 ) = ( ( 𝑋 + 𝑍 ) + 𝑌 ) )