Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > caofdi | Structured version Visualization version GIF version |
Description: Transfer a distributive law to the function operation. (Contributed by Mario Carneiro, 26-Jul-2014.) |
Ref | Expression |
---|---|
caofdi.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
caofdi.2 | ⊢ (𝜑 → 𝐹:𝐴⟶𝐾) |
caofdi.3 | ⊢ (𝜑 → 𝐺:𝐴⟶𝑆) |
caofdi.4 | ⊢ (𝜑 → 𝐻:𝐴⟶𝑆) |
caofdi.5 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐾 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑥𝑇(𝑦𝑅𝑧)) = ((𝑥𝑇𝑦)𝑂(𝑥𝑇𝑧))) |
Ref | Expression |
---|---|
caofdi | ⊢ (𝜑 → (𝐹 ∘f 𝑇(𝐺 ∘f 𝑅𝐻)) = ((𝐹 ∘f 𝑇𝐺) ∘f 𝑂(𝐹 ∘f 𝑇𝐻))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | caofdi.5 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐾 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑥𝑇(𝑦𝑅𝑧)) = ((𝑥𝑇𝑦)𝑂(𝑥𝑇𝑧))) | |
2 | 1 | adantlr 711 | . . . 4 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝐴) ∧ (𝑥 ∈ 𝐾 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑥𝑇(𝑦𝑅𝑧)) = ((𝑥𝑇𝑦)𝑂(𝑥𝑇𝑧))) |
3 | caofdi.2 | . . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶𝐾) | |
4 | 3 | ffvelrnda 6943 | . . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) ∈ 𝐾) |
5 | caofdi.3 | . . . . 5 ⊢ (𝜑 → 𝐺:𝐴⟶𝑆) | |
6 | 5 | ffvelrnda 6943 | . . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) ∈ 𝑆) |
7 | caofdi.4 | . . . . 5 ⊢ (𝜑 → 𝐻:𝐴⟶𝑆) | |
8 | 7 | ffvelrnda 6943 | . . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐻‘𝑤) ∈ 𝑆) |
9 | 2, 4, 6, 8 | caovdid 7465 | . . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤)𝑇((𝐺‘𝑤)𝑅(𝐻‘𝑤))) = (((𝐹‘𝑤)𝑇(𝐺‘𝑤))𝑂((𝐹‘𝑤)𝑇(𝐻‘𝑤)))) |
10 | 9 | mpteq2dva 5170 | . 2 ⊢ (𝜑 → (𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑇((𝐺‘𝑤)𝑅(𝐻‘𝑤)))) = (𝑤 ∈ 𝐴 ↦ (((𝐹‘𝑤)𝑇(𝐺‘𝑤))𝑂((𝐹‘𝑤)𝑇(𝐻‘𝑤))))) |
11 | caofdi.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
12 | ovexd 7290 | . . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐺‘𝑤)𝑅(𝐻‘𝑤)) ∈ V) | |
13 | 3 | feqmptd 6819 | . . 3 ⊢ (𝜑 → 𝐹 = (𝑤 ∈ 𝐴 ↦ (𝐹‘𝑤))) |
14 | 5 | feqmptd 6819 | . . . 4 ⊢ (𝜑 → 𝐺 = (𝑤 ∈ 𝐴 ↦ (𝐺‘𝑤))) |
15 | 7 | feqmptd 6819 | . . . 4 ⊢ (𝜑 → 𝐻 = (𝑤 ∈ 𝐴 ↦ (𝐻‘𝑤))) |
16 | 11, 6, 8, 14, 15 | offval2 7531 | . . 3 ⊢ (𝜑 → (𝐺 ∘f 𝑅𝐻) = (𝑤 ∈ 𝐴 ↦ ((𝐺‘𝑤)𝑅(𝐻‘𝑤)))) |
17 | 11, 4, 12, 13, 16 | offval2 7531 | . 2 ⊢ (𝜑 → (𝐹 ∘f 𝑇(𝐺 ∘f 𝑅𝐻)) = (𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑇((𝐺‘𝑤)𝑅(𝐻‘𝑤))))) |
18 | ovexd 7290 | . . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤)𝑇(𝐺‘𝑤)) ∈ V) | |
19 | ovexd 7290 | . . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤)𝑇(𝐻‘𝑤)) ∈ V) | |
20 | 11, 4, 6, 13, 14 | offval2 7531 | . . 3 ⊢ (𝜑 → (𝐹 ∘f 𝑇𝐺) = (𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑇(𝐺‘𝑤)))) |
21 | 11, 4, 8, 13, 15 | offval2 7531 | . . 3 ⊢ (𝜑 → (𝐹 ∘f 𝑇𝐻) = (𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑇(𝐻‘𝑤)))) |
22 | 11, 18, 19, 20, 21 | offval2 7531 | . 2 ⊢ (𝜑 → ((𝐹 ∘f 𝑇𝐺) ∘f 𝑂(𝐹 ∘f 𝑇𝐻)) = (𝑤 ∈ 𝐴 ↦ (((𝐹‘𝑤)𝑇(𝐺‘𝑤))𝑂((𝐹‘𝑤)𝑇(𝐻‘𝑤))))) |
23 | 10, 17, 22 | 3eqtr4d 2788 | 1 ⊢ (𝜑 → (𝐹 ∘f 𝑇(𝐺 ∘f 𝑅𝐻)) = ((𝐹 ∘f 𝑇𝐺) ∘f 𝑂(𝐹 ∘f 𝑇𝐻))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 Vcvv 3422 ↦ cmpt 5153 ⟶wf 6414 ‘cfv 6418 (class class class)co 7255 ∘f cof 7509 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pr 5347 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-ov 7258 df-oprab 7259 df-mpo 7260 df-of 7511 |
This theorem is referenced by: psrlmod 21080 plydivlem4 25361 plydiveu 25363 quotcan 25374 basellem9 26143 lflvsdi2 37020 mendlmod 40934 |
Copyright terms: Public domain | W3C validator |