| 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 8787 | . . . . 5 ⊢ (𝑋 ∈ (𝐵 ↑m 𝐼) → (𝐵 ∈ V ∧ 𝐼 ∈ V)) | |
| 2 | 1 | simprd 495 | . . . 4 ⊢ (𝑋 ∈ (𝐵 ↑m 𝐼) → 𝐼 ∈ V) |
| 3 | 2 | 3ad2ant1 1134 | . . 3 ⊢ ((𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼)) → 𝐼 ∈ V) |
| 4 | 3 | adantl 481 | . 2 ⊢ ((𝑀 ∈ Mnd ∧ (𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼))) → 𝐼 ∈ V) |
| 5 | elmapi 8788 | . . . 4 ⊢ (𝑋 ∈ (𝐵 ↑m 𝐼) → 𝑋:𝐼⟶𝐵) | |
| 6 | 5 | 3ad2ant1 1134 | . . 3 ⊢ ((𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼)) → 𝑋:𝐼⟶𝐵) |
| 7 | 6 | adantl 481 | . 2 ⊢ ((𝑀 ∈ Mnd ∧ (𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼))) → 𝑋:𝐼⟶𝐵) |
| 8 | elmapi 8788 | . . . 4 ⊢ (𝑌 ∈ (𝐵 ↑m 𝐼) → 𝑌:𝐼⟶𝐵) | |
| 9 | 8 | 3ad2ant2 1135 | . . 3 ⊢ ((𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼)) → 𝑌:𝐼⟶𝐵) |
| 10 | 9 | adantl 481 | . 2 ⊢ ((𝑀 ∈ Mnd ∧ (𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼))) → 𝑌:𝐼⟶𝐵) |
| 11 | elmapi 8788 | . . . 4 ⊢ (𝑍 ∈ (𝐵 ↑m 𝐼) → 𝑍:𝐼⟶𝐵) | |
| 12 | 11 | 3ad2ant3 1136 | . . 3 ⊢ ((𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼)) → 𝑍:𝐼⟶𝐵) |
| 13 | 12 | adantl 481 | . 2 ⊢ ((𝑀 ∈ Mnd ∧ (𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼))) → 𝑍:𝐼⟶𝐵) |
| 14 | mndvcl.b | . . . 4 ⊢ 𝐵 = (Base‘𝑀) | |
| 15 | mndvcl.p | . . . 4 ⊢ + = (+g‘𝑀) | |
| 16 | 14, 15 | mndass 18670 | . . 3 ⊢ ((𝑀 ∈ Mnd ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) |
| 17 | 16 | adantlr 716 | . 2 ⊢ (((𝑀 ∈ Mnd ∧ (𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼))) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) |
| 18 | 4, 7, 10, 13, 17 | caofass 7662 | 1 ⊢ ((𝑀 ∈ Mnd ∧ (𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼))) → ((𝑋 ∘f + 𝑌) ∘f + 𝑍) = (𝑋 ∘f + (𝑌 ∘f + 𝑍))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 Vcvv 3439 ⟶wf 6487 ‘cfv 6491 (class class class)co 7358 ∘f cof 7620 ↑m cmap 8765 Basecbs 17138 +gcplusg 17179 Mndcmnd 18661 |
| 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-10 2147 ax-11 2163 ax-12 2183 ax-ext 2707 ax-rep 5223 ax-sep 5240 ax-nul 5250 ax-pow 5309 ax-pr 5376 ax-un 7680 |
| 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-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2932 df-ral 3051 df-rex 3060 df-reu 3350 df-rab 3399 df-v 3441 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4947 df-br 5098 df-opab 5160 df-mpt 5179 df-id 5518 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-iota 6447 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-fv 6499 df-ov 7361 df-oprab 7362 df-mpo 7363 df-of 7622 df-1st 7933 df-2nd 7934 df-map 8767 df-sgrp 18646 df-mnd 18662 |
| This theorem is referenced by: mendring 43467 |
| Copyright terms: Public domain | W3C validator |