| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cmn246135 | Structured version Visualization version GIF version | ||
| Description: Rearrange terms in a commutative monoid sum. Lemma for rlocaddval 33361. (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 |
|---|---|
| cmn246135 | ⊢ (𝜑 → ((𝑋 + 𝑌) + ((𝑍 + 𝑈) + (𝑉 + 𝑊))) = ((𝑌 + (𝑈 + 𝑊)) + (𝑋 + (𝑍 + 𝑉)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cmn135246.3 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ CMnd) | |
| 2 | cmn135246.5 | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 3 | cmn135246.4 | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 4 | cmn135246.1 | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 5 | cmn135246.2 | . . . . 5 ⊢ + = (+g‘𝐺) | |
| 6 | 4, 5 | cmncom 19739 | . . . 4 ⊢ ((𝐺 ∈ CMnd ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + 𝑌) = (𝑌 + 𝑋)) |
| 7 | 1, 2, 3, 6 | syl3anc 1374 | . . 3 ⊢ (𝜑 → (𝑋 + 𝑌) = (𝑌 + 𝑋)) |
| 8 | cmn135246.6 | . . . . 5 ⊢ (𝜑 → 𝑍 ∈ 𝐵) | |
| 9 | cmn135246.7 | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ 𝐵) | |
| 10 | cmn135246.8 | . . . . 5 ⊢ (𝜑 → 𝑉 ∈ 𝐵) | |
| 11 | cmn135246.9 | . . . . 5 ⊢ (𝜑 → 𝑊 ∈ 𝐵) | |
| 12 | 4, 5, 1, 8, 9, 10, 11 | cmn4d 33124 | . . . 4 ⊢ (𝜑 → ((𝑍 + 𝑈) + (𝑉 + 𝑊)) = ((𝑍 + 𝑉) + (𝑈 + 𝑊))) |
| 13 | 1 | cmnmndd 19745 | . . . . . 6 ⊢ (𝜑 → 𝐺 ∈ Mnd) |
| 14 | 4, 5 | mndcl 18679 | . . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ 𝑍 ∈ 𝐵 ∧ 𝑉 ∈ 𝐵) → (𝑍 + 𝑉) ∈ 𝐵) |
| 15 | 13, 8, 10, 14 | syl3anc 1374 | . . . . 5 ⊢ (𝜑 → (𝑍 + 𝑉) ∈ 𝐵) |
| 16 | 4, 5 | mndcl 18679 | . . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ 𝑈 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) → (𝑈 + 𝑊) ∈ 𝐵) |
| 17 | 13, 9, 11, 16 | syl3anc 1374 | . . . . 5 ⊢ (𝜑 → (𝑈 + 𝑊) ∈ 𝐵) |
| 18 | 4, 5 | cmncom 19739 | . . . . 5 ⊢ ((𝐺 ∈ CMnd ∧ (𝑍 + 𝑉) ∈ 𝐵 ∧ (𝑈 + 𝑊) ∈ 𝐵) → ((𝑍 + 𝑉) + (𝑈 + 𝑊)) = ((𝑈 + 𝑊) + (𝑍 + 𝑉))) |
| 19 | 1, 15, 17, 18 | syl3anc 1374 | . . . 4 ⊢ (𝜑 → ((𝑍 + 𝑉) + (𝑈 + 𝑊)) = ((𝑈 + 𝑊) + (𝑍 + 𝑉))) |
| 20 | 12, 19 | eqtrd 2772 | . . 3 ⊢ (𝜑 → ((𝑍 + 𝑈) + (𝑉 + 𝑊)) = ((𝑈 + 𝑊) + (𝑍 + 𝑉))) |
| 21 | 7, 20 | oveq12d 7386 | . 2 ⊢ (𝜑 → ((𝑋 + 𝑌) + ((𝑍 + 𝑈) + (𝑉 + 𝑊))) = ((𝑌 + 𝑋) + ((𝑈 + 𝑊) + (𝑍 + 𝑉)))) |
| 22 | 4, 5, 1, 3, 2, 17, 15 | cmn4d 33124 | . 2 ⊢ (𝜑 → ((𝑌 + 𝑋) + ((𝑈 + 𝑊) + (𝑍 + 𝑉))) = ((𝑌 + (𝑈 + 𝑊)) + (𝑋 + (𝑍 + 𝑉)))) |
| 23 | 21, 22 | eqtrd 2772 | 1 ⊢ (𝜑 → ((𝑋 + 𝑌) + ((𝑍 + 𝑈) + (𝑉 + 𝑊))) = ((𝑌 + (𝑈 + 𝑊)) + (𝑋 + (𝑍 + 𝑉)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ‘cfv 6500 (class class class)co 7368 Basecbs 17148 +gcplusg 17189 Mndcmnd 18671 CMndccmn 19721 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-12 2185 ax-ext 2709 ax-nul 5253 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-sbc 3743 df-dif 3906 df-un 3908 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-iota 6456 df-fv 6508 df-ov 7371 df-mgm 18577 df-sgrp 18656 df-mnd 18672 df-cmn 19723 |
| This theorem is referenced by: rlocaddval 33361 rlocmulval 33362 |
| Copyright terms: Public domain | W3C validator |