| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mndvass | Structured version Visualization version GIF version | ||
| Description: Tuple-wise associativity in monoids. (Contributed by Stefan O'Rear, 5-Sep-2015.) |
| Ref | Expression |
|---|---|
| mndvcl.b | ⊢ 𝐵 = (Base‘𝑀) |
| mndvcl.p | ⊢ + = (+g‘𝑀) |
| Ref | Expression |
|---|---|
| mndvass | ⊢ ((𝑀 ∈ Mnd ∧ (𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼))) → ((𝑋 ∘f + 𝑌) ∘f + 𝑍) = (𝑋 ∘f + (𝑌 ∘f + 𝑍))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elmapex 8845 | . . . . 5 ⊢ (𝑋 ∈ (𝐵 ↑m 𝐼) → (𝐵 ∈ V ∧ 𝐼 ∈ V)) | |
| 2 | 1 | simprd 500 | . . . 4 ⊢ (𝑋 ∈ (𝐵 ↑m 𝐼) → 𝐼 ∈ V) |
| 3 | 2 | 3ad2ant1 1149 | . . 3 ⊢ ((𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼)) → 𝐼 ∈ V) |
| 4 | 3 | adantl 486 | . 2 ⊢ ((𝑀 ∈ Mnd ∧ (𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼))) → 𝐼 ∈ V) |
| 5 | elmapi 8846 | . . . 4 ⊢ (𝑋 ∈ (𝐵 ↑m 𝐼) → 𝑋:𝐼⟶𝐵) | |
| 6 | 5 | 3ad2ant1 1149 | . . 3 ⊢ ((𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼)) → 𝑋:𝐼⟶𝐵) |
| 7 | 6 | adantl 486 | . 2 ⊢ ((𝑀 ∈ Mnd ∧ (𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼))) → 𝑋:𝐼⟶𝐵) |
| 8 | elmapi 8846 | . . . 4 ⊢ (𝑌 ∈ (𝐵 ↑m 𝐼) → 𝑌:𝐼⟶𝐵) | |
| 9 | 8 | 3ad2ant2 1150 | . . 3 ⊢ ((𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼)) → 𝑌:𝐼⟶𝐵) |
| 10 | 9 | adantl 486 | . 2 ⊢ ((𝑀 ∈ Mnd ∧ (𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼))) → 𝑌:𝐼⟶𝐵) |
| 11 | elmapi 8846 | . . . 4 ⊢ (𝑍 ∈ (𝐵 ↑m 𝐼) → 𝑍:𝐼⟶𝐵) | |
| 12 | 11 | 3ad2ant3 1151 | . . 3 ⊢ ((𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼)) → 𝑍:𝐼⟶𝐵) |
| 13 | 12 | adantl 486 | . 2 ⊢ ((𝑀 ∈ Mnd ∧ (𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼))) → 𝑍:𝐼⟶𝐵) |
| 14 | mndvcl.b | . . . 4 ⊢ 𝐵 = (Base‘𝑀) | |
| 15 | mndvcl.p | . . . 4 ⊢ + = (+g‘𝑀) | |
| 16 | 14, 15 | mndass 18801 | . . 3 ⊢ ((𝑀 ∈ Mnd ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) |
| 17 | 16 | adantlr 727 | . 2 ⊢ (((𝑀 ∈ Mnd ∧ (𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼))) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) |
| 18 | 4, 7, 10, 13, 17 | caofass 7715 | 1 ⊢ ((𝑀 ∈ Mnd ∧ (𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼))) → ((𝑋 ∘f + 𝑌) ∘f + 𝑍) = (𝑋 ∘f + (𝑌 ∘f + 𝑍))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 Vcvv 3461 ⟶wf 6533 ‘cfv 6537 (class class class)co 7411 ∘f cof 7673 ↑m cmap 8824 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-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 |
| 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-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-reu 3376 df-rab 3423 df-v 3463 df-sbc 3752 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7414 df-oprab 7415 df-mpo 7416 df-of 7675 df-1st 7986 df-2nd 7987 df-map 8826 df-sgrp 18777 df-mnd 18793 |
| This theorem is referenced by: mendring 43842 |
| Copyright terms: Public domain | W3C validator |