| 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 33350. (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 19765 | . . . . . 6 ⊢ ((𝐺 ∈ CMnd ∧ 𝑍 ∈ 𝐵 ∧ 𝑈 ∈ 𝐵) → (𝑍 + 𝑈) = (𝑈 + 𝑍)) |
| 7 | 1, 2, 3, 6 | syl3anc 1379 | . . . . 5 ⊢ (𝜑 → (𝑍 + 𝑈) = (𝑈 + 𝑍)) |
| 8 | 7 | oveq1d 7372 | . . . 4 ⊢ (𝜑 → ((𝑍 + 𝑈) + (𝑉 + 𝑊)) = ((𝑈 + 𝑍) + (𝑉 + 𝑊))) |
| 9 | cmn135246.8 | . . . . 5 ⊢ (𝜑 → 𝑉 ∈ 𝐵) | |
| 10 | cmn135246.9 | . . . . 5 ⊢ (𝜑 → 𝑊 ∈ 𝐵) | |
| 11 | 4, 5, 1, 3, 2, 9, 10 | cmn4d 33112 | . . . 4 ⊢ (𝜑 → ((𝑈 + 𝑍) + (𝑉 + 𝑊)) = ((𝑈 + 𝑉) + (𝑍 + 𝑊))) |
| 12 | 8, 11 | eqtrd 2774 | . . 3 ⊢ (𝜑 → ((𝑍 + 𝑈) + (𝑉 + 𝑊)) = ((𝑈 + 𝑉) + (𝑍 + 𝑊))) |
| 13 | 12 | oveq2d 7373 | . 2 ⊢ (𝜑 → ((𝑋 + 𝑌) + ((𝑍 + 𝑈) + (𝑉 + 𝑊))) = ((𝑋 + 𝑌) + ((𝑈 + 𝑉) + (𝑍 + 𝑊)))) |
| 14 | cmn135246.5 | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 15 | 1 | cmnmndd 19771 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Mnd) |
| 16 | 4, 5 | mndcl 18702 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑈 ∈ 𝐵 ∧ 𝑉 ∈ 𝐵) → (𝑈 + 𝑉) ∈ 𝐵) |
| 17 | 15, 3, 9, 16 | syl3anc 1379 | . . 3 ⊢ (𝜑 → (𝑈 + 𝑉) ∈ 𝐵) |
| 18 | cmn135246.4 | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 19 | 4, 5 | mndcl 18702 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑍 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) → (𝑍 + 𝑊) ∈ 𝐵) |
| 20 | 15, 2, 10, 19 | syl3anc 1379 | . . 3 ⊢ (𝜑 → (𝑍 + 𝑊) ∈ 𝐵) |
| 21 | 4, 5, 1, 14, 17, 18, 20 | cmn4d 33112 | . 2 ⊢ (𝜑 → ((𝑋 + (𝑈 + 𝑉)) + (𝑌 + (𝑍 + 𝑊))) = ((𝑋 + 𝑌) + ((𝑈 + 𝑉) + (𝑍 + 𝑊)))) |
| 22 | 13, 21 | eqtr4d 2777 | 1 ⊢ (𝜑 → ((𝑋 + 𝑌) + ((𝑍 + 𝑈) + (𝑉 + 𝑊))) = ((𝑋 + (𝑈 + 𝑉)) + (𝑌 + (𝑍 + 𝑊)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1547 ∈ wcel 2119 ‘cfv 6486 (class class class)co 7357 Basecbs 17171 +gcplusg 17212 Mndcmnd 18694 CMndccmn 19747 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-12 2189 ax-ext 2711 ax-nul 5229 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-ne 2935 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-sbc 3724 df-dif 3886 df-un 3888 df-ss 3900 df-nul 4263 df-if 4456 df-sn 4557 df-pr 4559 df-op 4563 df-uni 4840 df-br 5074 df-iota 6442 df-fv 6494 df-ov 7360 df-mgm 18600 df-sgrp 18679 df-mnd 18695 df-cmn 19749 |
| This theorem is referenced by: rlocaddval 33350 rlocmulval 33351 |
| Copyright terms: Public domain | W3C validator |