| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lmodvsdir | Structured version Visualization version GIF version | ||
| Description: Distributive law for scalar product (right-distributivity). (ax-hvdistr1 31157 analog.) (Contributed by NM, 10-Jan-2014.) (Revised by Mario Carneiro, 22-Sep-2015.) |
| Ref | Expression |
|---|---|
| lmodvsdir.v | ⊢ 𝑉 = (Base‘𝑊) |
| lmodvsdir.a | ⊢ + = (+g‘𝑊) |
| lmodvsdir.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| lmodvsdir.s | ⊢ · = ( ·𝑠 ‘𝑊) |
| lmodvsdir.k | ⊢ 𝐾 = (Base‘𝐹) |
| lmodvsdir.p | ⊢ ⨣ = (+g‘𝐹) |
| Ref | Expression |
|---|---|
| lmodvsdir | ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lmodvsdir.v | . . . . . . . 8 ⊢ 𝑉 = (Base‘𝑊) | |
| 2 | lmodvsdir.a | . . . . . . . 8 ⊢ + = (+g‘𝑊) | |
| 3 | lmodvsdir.s | . . . . . . . 8 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 4 | lmodvsdir.f | . . . . . . . 8 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 5 | lmodvsdir.k | . . . . . . . 8 ⊢ 𝐾 = (Base‘𝐹) | |
| 6 | lmodvsdir.p | . . . . . . . 8 ⊢ ⨣ = (+g‘𝐹) | |
| 7 | eqid 2761 | . . . . . . . 8 ⊢ (.r‘𝐹) = (.r‘𝐹) | |
| 8 | eqid 2761 | . . . . . . . 8 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 9 | 1, 2, 3, 4, 5, 6, 7, 8 | lmodlema 20912 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋 + 𝑋)) = ((𝑅 · 𝑋) + (𝑅 · 𝑋)) ∧ ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) ∧ (((𝑄(.r‘𝐹)𝑅) · 𝑋) = (𝑄 · (𝑅 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋))) |
| 10 | 9 | simpld 498 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑅 · 𝑋) ∈ 𝑉 ∧ (𝑅 · (𝑋 + 𝑋)) = ((𝑅 · 𝑋) + (𝑅 · 𝑋)) ∧ ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋)))) |
| 11 | 10 | simp3d 1156 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) |
| 12 | 11 | 3expa 1130 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) |
| 13 | 12 | anabsan2 684 | . . 3 ⊢ (((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾)) ∧ 𝑋 ∈ 𝑉) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) |
| 14 | 13 | exp42 439 | . 2 ⊢ (𝑊 ∈ LMod → (𝑄 ∈ 𝐾 → (𝑅 ∈ 𝐾 → (𝑋 ∈ 𝑉 → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋)))))) |
| 15 | 14 | 3imp2 1362 | 1 ⊢ ((𝑊 ∈ LMod ∧ (𝑄 ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉)) → ((𝑄 ⨣ 𝑅) · 𝑋) = ((𝑄 · 𝑋) + (𝑅 · 𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ‘cfv 6517 (class class class)co 7392 Basecbs 17228 +gcplusg 17269 .rcmulr 17270 Scalarcsca 17272 ·𝑠 cvsca 17273 1rcur 20210 LModclmod 20907 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 ax-nul 5255 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3076 df-rab 3414 df-v 3455 df-sbc 3745 df-dif 3907 df-un 3909 df-ss 3921 df-nul 4286 df-if 4480 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-iota 6473 df-fv 6525 df-ov 7395 df-lmod 20909 |
| This theorem is referenced by: lmod0vs 20942 lmodvsmmulgdi 20944 lmodvneg1 20952 lmodcom 20955 lmodsubdir 20967 islss3 21006 lss1d 21010 prdslmodd 21016 lspsolvlem 21192 frlmup1 21830 asclghm 21914 scmataddcl 22556 scmatghm 22573 pm2mpghm 22856 clmvsdir 25133 cvsi 25172 lmodvslmhm 33191 imaslmod 33500 lshpkrlem4 39701 baerlem3lem1 42295 baerlem5blem1 42297 hgmapadd 42482 mendlmod 43730 lmodvsmdi 48965 lincsum 49015 ldepsprlem 49058 |
| Copyright terms: Public domain | W3C validator |