| 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 8905 | . . . . 5 ⊢ (𝑋 ∈ (𝐵 ↑m 𝐼) → (𝐵 ∈ V ∧ 𝐼 ∈ V)) | |
| 2 | 1 | simprd 501 | . . . 4 ⊢ (𝑋 ∈ (𝐵 ↑m 𝐼) → 𝐼 ∈ V) |
| 3 | 2 | 3ad2ant1 1152 | . . 3 ⊢ ((𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼)) → 𝐼 ∈ V) |
| 4 | 3 | adantl 487 | . 2 ⊢ ((𝑀 ∈ Mnd ∧ (𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼))) → 𝐼 ∈ V) |
| 5 | elmapi 8906 | . . . 4 ⊢ (𝑋 ∈ (𝐵 ↑m 𝐼) → 𝑋:𝐼⟶𝐵) | |
| 6 | 5 | 3ad2ant1 1152 | . . 3 ⊢ ((𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼)) → 𝑋:𝐼⟶𝐵) |
| 7 | 6 | adantl 487 | . 2 ⊢ ((𝑀 ∈ Mnd ∧ (𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼))) → 𝑋:𝐼⟶𝐵) |
| 8 | elmapi 8906 | . . . 4 ⊢ (𝑌 ∈ (𝐵 ↑m 𝐼) → 𝑌:𝐼⟶𝐵) | |
| 9 | 8 | 3ad2ant2 1153 | . . 3 ⊢ ((𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼)) → 𝑌:𝐼⟶𝐵) |
| 10 | 9 | adantl 487 | . 2 ⊢ ((𝑀 ∈ Mnd ∧ (𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼))) → 𝑌:𝐼⟶𝐵) |
| 11 | elmapi 8906 | . . . 4 ⊢ (𝑍 ∈ (𝐵 ↑m 𝐼) → 𝑍:𝐼⟶𝐵) | |
| 12 | 11 | 3ad2ant3 1154 | . . 3 ⊢ ((𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼)) → 𝑍:𝐼⟶𝐵) |
| 13 | 12 | adantl 487 | . 2 ⊢ ((𝑀 ∈ Mnd ∧ (𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼))) → 𝑍:𝐼⟶𝐵) |
| 14 | mndvcl.b | . . . 4 ⊢ 𝐵 = (Base‘𝑀) | |
| 15 | mndvcl.p | . . . 4 ⊢ + = (+g‘𝑀) | |
| 16 | 14, 15 | mndass 18984 | . . 3 ⊢ ((𝑀 ∈ Mnd ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) |
| 17 | 16 | adantlr 728 | . 2 ⊢ (((𝑀 ∈ Mnd ∧ (𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼))) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) |
| 18 | 4, 7, 10, 13, 17 | caofass 7764 | 1 ⊢ ((𝑀 ∈ Mnd ∧ (𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼) ∧ 𝑍 ∈ (𝐵 ↑m 𝐼))) → ((𝑋 ∘f + 𝑌) ∘f + 𝑍) = (𝑋 ∘f + (𝑌 ∘f + 𝑍))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1104 = wceq 1572 ∈ wcel 2150 Vcvv 3453 ⟶wf 6561 ‘cfv 6565 (class class class)co 7450 ∘f cof 7722 ↑m cmap 8884 Basecbs 17433 +gcplusg 17474 Mndcmnd 18975 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-id 5552 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-ov 7453 df-oprab 7454 df-mpo 7455 df-of 7724 df-1st 8034 df-2nd 8035 df-map 8886 df-sgrp 18960 df-mnd 18976 |
| This theorem is used by: mendring 44450 |
| Copyright terms: Public domain | W3C validator |