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

Theorem mnd4g 18711
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
StepHypRef 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 (𝜑 → (𝑌 + 𝑍) = (𝑍 + 𝑌))
81, 2, 3, 4, 5, 6, 7mnd12g 18710 . . 3 (𝜑 → (𝑌 + (𝑍 + 𝑊)) = (𝑍 + (𝑌 + 𝑊)))
98oveq2d 7435 . 2 (𝜑 → (𝑋 + (𝑌 + (𝑍 + 𝑊))) = (𝑋 + (𝑍 + (𝑌 + 𝑊))))
10 mnd4g.2 . . 3 (𝜑𝑋𝐵)
111, 2mndcl 18705 . . . 4 ((𝐺 ∈ Mnd ∧ 𝑍𝐵𝑊𝐵) → (𝑍 + 𝑊) ∈ 𝐵)
123, 5, 6, 11syl3anc 1368 . . 3 (𝜑 → (𝑍 + 𝑊) ∈ 𝐵)
131, 2mndass 18706 . . 3 ((𝐺 ∈ Mnd ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑍 + 𝑊) ∈ 𝐵)) → ((𝑋 + 𝑌) + (𝑍 + 𝑊)) = (𝑋 + (𝑌 + (𝑍 + 𝑊))))
143, 10, 4, 12, 13syl13anc 1369 . 2 (𝜑 → ((𝑋 + 𝑌) + (𝑍 + 𝑊)) = (𝑋 + (𝑌 + (𝑍 + 𝑊))))
151, 2mndcl 18705 . . . 4 ((𝐺 ∈ Mnd ∧ 𝑌𝐵𝑊𝐵) → (𝑌 + 𝑊) ∈ 𝐵)
163, 4, 6, 15syl3anc 1368 . . 3 (𝜑 → (𝑌 + 𝑊) ∈ 𝐵)
171, 2mndass 18706 . . 3 ((𝐺 ∈ Mnd ∧ (𝑋𝐵𝑍𝐵 ∧ (𝑌 + 𝑊) ∈ 𝐵)) → ((𝑋 + 𝑍) + (𝑌 + 𝑊)) = (𝑋 + (𝑍 + (𝑌 + 𝑊))))
183, 10, 5, 16, 17syl13anc 1369 . 2 (𝜑 → ((𝑋 + 𝑍) + (𝑌 + 𝑊)) = (𝑋 + (𝑍 + (𝑌 + 𝑊))))
199, 14, 183eqtr4d 2775 1 (𝜑 → ((𝑋 + 𝑌) + (𝑍 + 𝑊)) = ((𝑋 + 𝑍) + (𝑌 + 𝑊)))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1533  wcel 2098  cfv 6549  (class class class)co 7419  Basecbs 17183  +gcplusg 17236  Mndcmnd 18697
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2696  ax-nul 5307
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2703  df-cleq 2717  df-clel 2802  df-ne 2930  df-ral 3051  df-rex 3060  df-rab 3419  df-v 3463  df-sbc 3774  df-dif 3947  df-un 3949  df-ss 3961  df-nul 4323  df-if 4531  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4910  df-br 5150  df-iota 6501  df-fv 6557  df-ov 7422  df-mgm 18603  df-sgrp 18682  df-mnd 18698
This theorem is referenced by:  lsmsubm  19620  pj1ghm  19670  cmn4  19768  gsumzaddlem  19888
  Copyright terms: Public domain W3C validator