| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cmn145236 | Structured version Visualization version GIF version | ||
| Description: Rearrange terms in a commutative monoid sum. Lemma for rlocaddval 33598. (Contributed by Thierry Arnoux, 4-May-2025.) |
| Ref | Expression |
|---|---|
| cmn135246.1 | ⊢ 𝐵 = (Base‘𝐺) |
| cmn135246.2 | ⊢ + = (+g‘𝐺) |
| cmn135246.3 | ⊢ (𝜑 → 𝐺 ∈ CMnd) |
| cmn135246.5 | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| cmn135246.4 | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| cmn135246.6 | ⊢ (𝜑 → 𝑍 ∈ 𝐵) |
| cmn135246.7 | ⊢ (𝜑 → 𝑈 ∈ 𝐵) |
| cmn135246.8 | ⊢ (𝜑 → 𝑉 ∈ 𝐵) |
| cmn135246.9 | ⊢ (𝜑 → 𝑊 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| cmn145236 | ⊢ (𝜑 → ((𝑋 + 𝑌) + ((𝑍 + 𝑈) + (𝑉 + 𝑊))) = ((𝑋 + (𝑈 + 𝑉)) + (𝑌 + (𝑍 + 𝑊)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cmn135246.3 | . . . . . 6 ⊢ (𝜑 → 𝐺 ∈ CMnd) | |
| 2 | cmn135246.6 | . . . . . 6 ⊢ (𝜑 → 𝑍 ∈ 𝐵) | |
| 3 | cmn135246.7 | . . . . . 6 ⊢ (𝜑 → 𝑈 ∈ 𝐵) | |
| 4 | cmn135246.1 | . . . . . . 7 ⊢ 𝐵 = (Base‘𝐺) | |
| 5 | cmn135246.2 | . . . . . . 7 ⊢ + = (+g‘𝐺) | |
| 6 | 4, 5 | cmncom 19872 | . . . . . 6 ⊢ ((𝐺 ∈ CMnd ∧ 𝑍 ∈ 𝐵 ∧ 𝑈 ∈ 𝐵) → (𝑍 + 𝑈) = (𝑈 + 𝑍)) |
| 7 | 1, 2, 3, 6 | syl3anc 1398 | . . . . 5 ⊢ (𝜑 → (𝑍 + 𝑈) = (𝑈 + 𝑍)) |
| 8 | 7 | oveq1d 7425 | . . . 4 ⊢ (𝜑 → ((𝑍 + 𝑈) + (𝑉 + 𝑊)) = ((𝑈 + 𝑍) + (𝑉 + 𝑊))) |
| 9 | cmn135246.8 | . . . . 5 ⊢ (𝜑 → 𝑉 ∈ 𝐵) | |
| 10 | cmn135246.9 | . . . . 5 ⊢ (𝜑 → 𝑊 ∈ 𝐵) | |
| 11 | 4, 5, 1, 3, 2, 9, 10 | cmn4d 33361 | . . . 4 ⊢ (𝜑 → ((𝑈 + 𝑍) + (𝑉 + 𝑊)) = ((𝑈 + 𝑉) + (𝑍 + 𝑊))) |
| 12 | 8, 11 | eqtrd 2798 | . . 3 ⊢ (𝜑 → ((𝑍 + 𝑈) + (𝑉 + 𝑊)) = ((𝑈 + 𝑉) + (𝑍 + 𝑊))) |
| 13 | 12 | oveq2d 7426 | . 2 ⊢ (𝜑 → ((𝑋 + 𝑌) + ((𝑍 + 𝑈) + (𝑉 + 𝑊))) = ((𝑋 + 𝑌) + ((𝑈 + 𝑉) + (𝑍 + 𝑊)))) |
| 14 | cmn135246.5 | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 15 | 1 | cmnmndd 19878 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Mnd) |
| 16 | 4, 5 | mndcl 18804 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑈 ∈ 𝐵 ∧ 𝑉 ∈ 𝐵) → (𝑈 + 𝑉) ∈ 𝐵) |
| 17 | 15, 3, 9, 16 | syl3anc 1398 | . . 3 ⊢ (𝜑 → (𝑈 + 𝑉) ∈ 𝐵) |
| 18 | cmn135246.4 | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 19 | 4, 5 | mndcl 18804 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑍 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) → (𝑍 + 𝑊) ∈ 𝐵) |
| 20 | 15, 2, 10, 19 | syl3anc 1398 | . . 3 ⊢ (𝜑 → (𝑍 + 𝑊) ∈ 𝐵) |
| 21 | 4, 5, 1, 14, 17, 18, 20 | cmn4d 33361 | . 2 ⊢ (𝜑 → ((𝑋 + (𝑈 + 𝑉)) + (𝑌 + (𝑍 + 𝑊))) = ((𝑋 + 𝑌) + ((𝑈 + 𝑉) + (𝑍 + 𝑊)))) |
| 22 | 13, 21 | eqtr4d 2801 | 1 ⊢ (𝜑 → ((𝑋 + 𝑌) + ((𝑍 + 𝑈) + (𝑉 + 𝑊))) = ((𝑋 + (𝑈 + 𝑉)) + (𝑌 + (𝑍 + 𝑊)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2143 ‘cfv 6536 (class class class)co 7410 Basecbs 17273 +gcplusg 17314 Mndcmnd 18796 CMndccmn 19854 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-12 2213 ax-ext 2735 ax-nul 5269 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3745 df-dif 3908 df-un 3910 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-iota 6492 df-fv 6544 df-ov 7413 df-mgm 18702 df-sgrp 18781 df-mnd 18797 df-cmn 19856 |
| This theorem is used by: rlocaddval 33598 rlocmulval 33599 |
| Copyright terms: Public domain | W3C validator |