Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > ldualvsdi1 | Structured version Visualization version GIF version |
Description: Distributive law for scalar product operation, using operations from the dual space. (Contributed by NM, 21-Oct-2014.) |
Ref | Expression |
---|---|
ldualvsdi1.f | ⊢ 𝐹 = (LFnl‘𝑊) |
ldualvsdi1.r | ⊢ 𝑅 = (Scalar‘𝑊) |
ldualvsdi1.k | ⊢ 𝐾 = (Base‘𝑅) |
ldualvsdi1.d | ⊢ 𝐷 = (LDual‘𝑊) |
ldualvsdi1.p | ⊢ + = (+g‘𝐷) |
ldualvsdi1.s | ⊢ · = ( ·𝑠 ‘𝐷) |
ldualvsdi1.w | ⊢ (𝜑 → 𝑊 ∈ LMod) |
ldualvsdi1.x | ⊢ (𝜑 → 𝑋 ∈ 𝐾) |
ldualvsdi1.g | ⊢ (𝜑 → 𝐺 ∈ 𝐹) |
ldualvsdi1.h | ⊢ (𝜑 → 𝐻 ∈ 𝐹) |
Ref | Expression |
---|---|
ldualvsdi1 | ⊢ (𝜑 → (𝑋 · (𝐺 + 𝐻)) = ((𝑋 · 𝐺) + (𝑋 · 𝐻))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ldualvsdi1.f | . . . 4 ⊢ 𝐹 = (LFnl‘𝑊) | |
2 | eqid 2738 | . . . 4 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
3 | ldualvsdi1.r | . . . 4 ⊢ 𝑅 = (Scalar‘𝑊) | |
4 | ldualvsdi1.k | . . . 4 ⊢ 𝐾 = (Base‘𝑅) | |
5 | eqid 2738 | . . . 4 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
6 | ldualvsdi1.d | . . . 4 ⊢ 𝐷 = (LDual‘𝑊) | |
7 | ldualvsdi1.s | . . . 4 ⊢ · = ( ·𝑠 ‘𝐷) | |
8 | ldualvsdi1.w | . . . 4 ⊢ (𝜑 → 𝑊 ∈ LMod) | |
9 | ldualvsdi1.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐾) | |
10 | ldualvsdi1.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ 𝐹) | |
11 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 | ldualvs 37078 | . . 3 ⊢ (𝜑 → (𝑋 · 𝐺) = (𝐺 ∘f (.r‘𝑅)((Base‘𝑊) × {𝑋}))) |
12 | ldualvsdi1.h | . . . 4 ⊢ (𝜑 → 𝐻 ∈ 𝐹) | |
13 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 12 | ldualvs 37078 | . . 3 ⊢ (𝜑 → (𝑋 · 𝐻) = (𝐻 ∘f (.r‘𝑅)((Base‘𝑊) × {𝑋}))) |
14 | 11, 13 | oveq12d 7273 | . 2 ⊢ (𝜑 → ((𝑋 · 𝐺) ∘f (+g‘𝑅)(𝑋 · 𝐻)) = ((𝐺 ∘f (.r‘𝑅)((Base‘𝑊) × {𝑋})) ∘f (+g‘𝑅)(𝐻 ∘f (.r‘𝑅)((Base‘𝑊) × {𝑋})))) |
15 | eqid 2738 | . . 3 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
16 | ldualvsdi1.p | . . 3 ⊢ + = (+g‘𝐷) | |
17 | 1, 3, 4, 6, 7, 8, 9, 10 | ldualvscl 37080 | . . 3 ⊢ (𝜑 → (𝑋 · 𝐺) ∈ 𝐹) |
18 | 1, 3, 4, 6, 7, 8, 9, 12 | ldualvscl 37080 | . . 3 ⊢ (𝜑 → (𝑋 · 𝐻) ∈ 𝐹) |
19 | 1, 3, 15, 6, 16, 8, 17, 18 | ldualvadd 37070 | . 2 ⊢ (𝜑 → ((𝑋 · 𝐺) + (𝑋 · 𝐻)) = ((𝑋 · 𝐺) ∘f (+g‘𝑅)(𝑋 · 𝐻))) |
20 | 1, 6, 16, 8, 10, 12 | ldualvaddcl 37071 | . . . 4 ⊢ (𝜑 → (𝐺 + 𝐻) ∈ 𝐹) |
21 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 20 | ldualvs 37078 | . . 3 ⊢ (𝜑 → (𝑋 · (𝐺 + 𝐻)) = ((𝐺 + 𝐻) ∘f (.r‘𝑅)((Base‘𝑊) × {𝑋}))) |
22 | 1, 3, 15, 6, 16, 8, 10, 12 | ldualvadd 37070 | . . . 4 ⊢ (𝜑 → (𝐺 + 𝐻) = (𝐺 ∘f (+g‘𝑅)𝐻)) |
23 | 22 | oveq1d 7270 | . . 3 ⊢ (𝜑 → ((𝐺 + 𝐻) ∘f (.r‘𝑅)((Base‘𝑊) × {𝑋})) = ((𝐺 ∘f (+g‘𝑅)𝐻) ∘f (.r‘𝑅)((Base‘𝑊) × {𝑋}))) |
24 | 2, 3, 4, 15, 5, 1, 8, 9, 10, 12 | lflvsdi1 37019 | . . 3 ⊢ (𝜑 → ((𝐺 ∘f (+g‘𝑅)𝐻) ∘f (.r‘𝑅)((Base‘𝑊) × {𝑋})) = ((𝐺 ∘f (.r‘𝑅)((Base‘𝑊) × {𝑋})) ∘f (+g‘𝑅)(𝐻 ∘f (.r‘𝑅)((Base‘𝑊) × {𝑋})))) |
25 | 21, 23, 24 | 3eqtrd 2782 | . 2 ⊢ (𝜑 → (𝑋 · (𝐺 + 𝐻)) = ((𝐺 ∘f (.r‘𝑅)((Base‘𝑊) × {𝑋})) ∘f (+g‘𝑅)(𝐻 ∘f (.r‘𝑅)((Base‘𝑊) × {𝑋})))) |
26 | 14, 19, 25 | 3eqtr4rd 2789 | 1 ⊢ (𝜑 → (𝑋 · (𝐺 + 𝐻)) = ((𝑋 · 𝐺) + (𝑋 · 𝐻))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2108 {csn 4558 × cxp 5578 ‘cfv 6418 (class class class)co 7255 ∘f cof 7509 Basecbs 16840 +gcplusg 16888 .rcmulr 16889 Scalarcsca 16891 ·𝑠 cvsca 16892 LModclmod 20038 LFnlclfn 36998 LDualcld 37064 |
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-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 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-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 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-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 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-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 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-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-of 7511 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-er 8456 df-map 8575 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-2 11966 df-3 11967 df-4 11968 df-5 11969 df-6 11970 df-n0 12164 df-z 12250 df-uz 12512 df-fz 13169 df-struct 16776 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-plusg 16901 df-sca 16904 df-vsca 16905 df-0g 17069 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-grp 18495 df-minusg 18496 df-sbg 18497 df-cmn 19303 df-abl 19304 df-mgp 19636 df-ur 19653 df-ring 19700 df-lmod 20040 df-lfl 36999 df-ldual 37065 |
This theorem is referenced by: lduallmodlem 37093 |
Copyright terms: Public domain | W3C validator |