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

Theorem mnd4g 18806
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 18805 . . 3 (𝜑 → (𝑌 + (𝑍 + 𝑊)) = (𝑍 + (𝑌 + 𝑊)))
98oveq2d 7427 . 2 (𝜑 → (𝑋 + (𝑌 + (𝑍 + 𝑊))) = (𝑋 + (𝑍 + (𝑌 + 𝑊))))
10 mnd4g.2 . . 3 (𝜑𝑋𝐵)
111, 2mndcl 18800 . . . 4 ((𝐺 ∈ Mnd ∧ 𝑍𝐵𝑊𝐵) → (𝑍 + 𝑊) ∈ 𝐵)
123, 5, 6, 11syl3anc 1396 . . 3 (𝜑 → (𝑍 + 𝑊) ∈ 𝐵)
131, 2mndass 18801 . . 3 ((𝐺 ∈ Mnd ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑍 + 𝑊) ∈ 𝐵)) → ((𝑋 + 𝑌) + (𝑍 + 𝑊)) = (𝑋 + (𝑌 + (𝑍 + 𝑊))))
143, 10, 4, 12, 13syl13anc 1397 . 2 (𝜑 → ((𝑋 + 𝑌) + (𝑍 + 𝑊)) = (𝑋 + (𝑌 + (𝑍 + 𝑊))))
151, 2mndcl 18800 . . . 4 ((𝐺 ∈ Mnd ∧ 𝑌𝐵𝑊𝐵) → (𝑌 + 𝑊) ∈ 𝐵)
163, 4, 6, 15syl3anc 1396 . . 3 (𝜑 → (𝑌 + 𝑊) ∈ 𝐵)
171, 2mndass 18801 . . 3 ((𝐺 ∈ Mnd ∧ (𝑋𝐵𝑍𝐵 ∧ (𝑌 + 𝑊) ∈ 𝐵)) → ((𝑋 + 𝑍) + (𝑌 + 𝑊)) = (𝑋 + (𝑍 + (𝑌 + 𝑊))))
183, 10, 5, 16, 17syl13anc 1397 . 2 (𝜑 → ((𝑋 + 𝑍) + (𝑌 + 𝑊)) = (𝑋 + (𝑍 + (𝑌 + 𝑊))))
199, 14, 183eqtr4d 2814 1 (𝜑 → ((𝑋 + 𝑌) + (𝑍 + 𝑊)) = ((𝑋 + 𝑍) + (𝑌 + 𝑊)))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1567  wcel 2149  cfv 6537  (class class class)co 7411  Basecbs 17269  +gcplusg 17310  Mndcmnd 18792
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-nul 5271
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-sbc 3754  df-dif 3916  df-un 3918  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-iota 6493  df-fv 6545  df-ov 7414  df-mgm 18698  df-sgrp 18777  df-mnd 18793
This theorem is referenced by:  lsmsubm  19723  pj1ghm  19773  cmn4  19871  gsumzaddlem  19991
  Copyright terms: Public domain W3C validator