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 713 | . . . 4 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝐴) ∧ (𝑥 ∈ 𝐾 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑥𝑇(𝑦𝑅𝑧)) = ((𝑥𝑇𝑦)𝑂(𝑥𝑇𝑧))) |
3 | caofdi.2 | . . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶𝐾) | |
4 | 3 | ffvelrnda 6853 | . . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) ∈ 𝐾) |
5 | caofdi.3 | . . . . 5 ⊢ (𝜑 → 𝐺:𝐴⟶𝑆) | |
6 | 5 | ffvelrnda 6853 | . . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) ∈ 𝑆) |
7 | caofdi.4 | . . . . 5 ⊢ (𝜑 → 𝐻:𝐴⟶𝑆) | |
8 | 7 | ffvelrnda 6853 | . . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐻‘𝑤) ∈ 𝑆) |
9 | 2, 4, 6, 8 | caovdid 7365 | . . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤)𝑇((𝐺‘𝑤)𝑅(𝐻‘𝑤))) = (((𝐹‘𝑤)𝑇(𝐺‘𝑤))𝑂((𝐹‘𝑤)𝑇(𝐻‘𝑤)))) |
10 | 9 | mpteq2dva 5163 | . 2 ⊢ (𝜑 → (𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑇((𝐺‘𝑤)𝑅(𝐻‘𝑤)))) = (𝑤 ∈ 𝐴 ↦ (((𝐹‘𝑤)𝑇(𝐺‘𝑤))𝑂((𝐹‘𝑤)𝑇(𝐻‘𝑤))))) |
11 | caofdi.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
12 | ovexd 7193 | . . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐺‘𝑤)𝑅(𝐻‘𝑤)) ∈ V) | |
13 | 3 | feqmptd 6735 | . . 3 ⊢ (𝜑 → 𝐹 = (𝑤 ∈ 𝐴 ↦ (𝐹‘𝑤))) |
14 | 5 | feqmptd 6735 | . . . 4 ⊢ (𝜑 → 𝐺 = (𝑤 ∈ 𝐴 ↦ (𝐺‘𝑤))) |
15 | 7 | feqmptd 6735 | . . . 4 ⊢ (𝜑 → 𝐻 = (𝑤 ∈ 𝐴 ↦ (𝐻‘𝑤))) |
16 | 11, 6, 8, 14, 15 | offval2 7428 | . . 3 ⊢ (𝜑 → (𝐺 ∘f 𝑅𝐻) = (𝑤 ∈ 𝐴 ↦ ((𝐺‘𝑤)𝑅(𝐻‘𝑤)))) |
17 | 11, 4, 12, 13, 16 | offval2 7428 | . 2 ⊢ (𝜑 → (𝐹 ∘f 𝑇(𝐺 ∘f 𝑅𝐻)) = (𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑇((𝐺‘𝑤)𝑅(𝐻‘𝑤))))) |
18 | ovexd 7193 | . . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤)𝑇(𝐺‘𝑤)) ∈ V) | |
19 | ovexd 7193 | . . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤)𝑇(𝐻‘𝑤)) ∈ V) | |
20 | 11, 4, 6, 13, 14 | offval2 7428 | . . 3 ⊢ (𝜑 → (𝐹 ∘f 𝑇𝐺) = (𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑇(𝐺‘𝑤)))) |
21 | 11, 4, 8, 13, 15 | offval2 7428 | . . 3 ⊢ (𝜑 → (𝐹 ∘f 𝑇𝐻) = (𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑇(𝐻‘𝑤)))) |
22 | 11, 18, 19, 20, 21 | offval2 7428 | . 2 ⊢ (𝜑 → ((𝐹 ∘f 𝑇𝐺) ∘f 𝑂(𝐹 ∘f 𝑇𝐻)) = (𝑤 ∈ 𝐴 ↦ (((𝐹‘𝑤)𝑇(𝐺‘𝑤))𝑂((𝐹‘𝑤)𝑇(𝐻‘𝑤))))) |
23 | 10, 17, 22 | 3eqtr4d 2868 | 1 ⊢ (𝜑 → (𝐹 ∘f 𝑇(𝐺 ∘f 𝑅𝐻)) = ((𝐹 ∘f 𝑇𝐺) ∘f 𝑂(𝐹 ∘f 𝑇𝐻))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 Vcvv 3496 ↦ cmpt 5148 ⟶wf 6353 ‘cfv 6357 (class class class)co 7158 ∘f cof 7409 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-reu 3147 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-ov 7161 df-oprab 7162 df-mpo 7163 df-of 7411 |
This theorem is referenced by: psrlmod 20183 plydivlem4 24887 plydiveu 24889 quotcan 24900 basellem9 25668 lflvsdi2 36217 mendlmod 39800 |
Copyright terms: Public domain | W3C validator |