| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gsumvsmul | Structured version Visualization version GIF version | ||
| Description: Pull a scalar multiplication out of a sum of vectors. This theorem properly generalizes gsummulc2 20291, since every ring is a left module over itself. (Contributed by Stefan O'Rear, 6-Feb-2015.) (Revised by Mario Carneiro, 5-May-2015.) (Revised by AV, 10-Jul-2019.) |
| Ref | Expression |
|---|---|
| gsumvsmul.b | ⊢ 𝐵 = (Base‘𝑅) |
| gsumvsmul.s | ⊢ 𝑆 = (Scalar‘𝑅) |
| gsumvsmul.k | ⊢ 𝐾 = (Base‘𝑆) |
| gsumvsmul.z | ⊢ 0 = (0g‘𝑅) |
| gsumvsmul.p | ⊢ + = (+g‘𝑅) |
| gsumvsmul.t | ⊢ · = ( ·𝑠 ‘𝑅) |
| gsumvsmul.r | ⊢ (𝜑 → 𝑅 ∈ LMod) |
| gsumvsmul.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| gsumvsmul.x | ⊢ (𝜑 → 𝑋 ∈ 𝐾) |
| gsumvsmul.y | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑌 ∈ 𝐵) |
| gsumvsmul.n | ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝑌) finSupp 0 ) |
| Ref | Expression |
|---|---|
| gsumvsmul | ⊢ (𝜑 → (𝑅 Σg (𝑘 ∈ 𝐴 ↦ (𝑋 · 𝑌))) = (𝑋 · (𝑅 Σg (𝑘 ∈ 𝐴 ↦ 𝑌)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | gsumvsmul.b | . 2 ⊢ 𝐵 = (Base‘𝑅) | |
| 2 | gsumvsmul.z | . 2 ⊢ 0 = (0g‘𝑅) | |
| 3 | gsumvsmul.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ LMod) | |
| 4 | lmodcmn 20900 | . . 3 ⊢ (𝑅 ∈ LMod → 𝑅 ∈ CMnd) | |
| 5 | 3, 4 | syl 17 | . 2 ⊢ (𝜑 → 𝑅 ∈ CMnd) |
| 6 | cmnmnd 19767 | . . 3 ⊢ (𝑅 ∈ CMnd → 𝑅 ∈ Mnd) | |
| 7 | 5, 6 | syl 17 | . 2 ⊢ (𝜑 → 𝑅 ∈ Mnd) |
| 8 | gsumvsmul.a | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 9 | gsumvsmul.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐾) | |
| 10 | gsumvsmul.s | . . . . 5 ⊢ 𝑆 = (Scalar‘𝑅) | |
| 11 | gsumvsmul.t | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑅) | |
| 12 | gsumvsmul.k | . . . . 5 ⊢ 𝐾 = (Base‘𝑆) | |
| 13 | 1, 10, 11, 12 | lmodvsghm 20913 | . . . 4 ⊢ ((𝑅 ∈ LMod ∧ 𝑋 ∈ 𝐾) → (𝑦 ∈ 𝐵 ↦ (𝑋 · 𝑦)) ∈ (𝑅 GrpHom 𝑅)) |
| 14 | 3, 9, 13 | syl2anc 585 | . . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ (𝑋 · 𝑦)) ∈ (𝑅 GrpHom 𝑅)) |
| 15 | ghmmhm 19196 | . . 3 ⊢ ((𝑦 ∈ 𝐵 ↦ (𝑋 · 𝑦)) ∈ (𝑅 GrpHom 𝑅) → (𝑦 ∈ 𝐵 ↦ (𝑋 · 𝑦)) ∈ (𝑅 MndHom 𝑅)) | |
| 16 | 14, 15 | syl 17 | . 2 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ (𝑋 · 𝑦)) ∈ (𝑅 MndHom 𝑅)) |
| 17 | gsumvsmul.y | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑌 ∈ 𝐵) | |
| 18 | gsumvsmul.n | . 2 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝑌) finSupp 0 ) | |
| 19 | oveq2 7370 | . 2 ⊢ (𝑦 = 𝑌 → (𝑋 · 𝑦) = (𝑋 · 𝑌)) | |
| 20 | oveq2 7370 | . 2 ⊢ (𝑦 = (𝑅 Σg (𝑘 ∈ 𝐴 ↦ 𝑌)) → (𝑋 · 𝑦) = (𝑋 · (𝑅 Σg (𝑘 ∈ 𝐴 ↦ 𝑌)))) | |
| 21 | 1, 2, 5, 7, 8, 16, 17, 18, 19, 20 | gsummhm2 19909 | 1 ⊢ (𝜑 → (𝑅 Σg (𝑘 ∈ 𝐴 ↦ (𝑋 · 𝑌))) = (𝑋 · (𝑅 Σg (𝑘 ∈ 𝐴 ↦ 𝑌)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 class class class wbr 5086 ↦ cmpt 5167 ‘cfv 6494 (class class class)co 7362 finSupp cfsupp 9269 Basecbs 17174 +gcplusg 17215 Scalarcsca 17218 ·𝑠 cvsca 17219 0gc0g 17397 Σg cgsu 17398 Mndcmnd 18697 MndHom cmhm 18744 GrpHom cghm 19182 CMndccmn 19750 LModclmod 20850 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5304 ax-pr 5372 ax-un 7684 ax-cnex 11089 ax-resscn 11090 ax-1cn 11091 ax-icn 11092 ax-addcl 11093 ax-addrcl 11094 ax-mulcl 11095 ax-mulrcl 11096 ax-mulcom 11097 ax-addass 11098 ax-mulass 11099 ax-distr 11100 ax-i2m1 11101 ax-1ne0 11102 ax-1rid 11103 ax-rnegex 11104 ax-rrecex 11105 ax-cnre 11106 ax-pre-lttri 11107 ax-pre-lttrn 11108 ax-pre-ltadd 11109 ax-pre-mulgt0 11110 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5521 df-eprel 5526 df-po 5534 df-so 5535 df-fr 5579 df-se 5580 df-we 5581 df-xp 5632 df-rel 5633 df-cnv 5634 df-co 5635 df-dm 5636 df-rn 5637 df-res 5638 df-ima 5639 df-pred 6261 df-ord 6322 df-on 6323 df-lim 6324 df-suc 6325 df-iota 6450 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-isom 6503 df-riota 7319 df-ov 7365 df-oprab 7366 df-mpo 7367 df-om 7813 df-1st 7937 df-2nd 7938 df-supp 8106 df-frecs 8226 df-wrecs 8257 df-recs 8306 df-rdg 8344 df-1o 8400 df-er 8638 df-map 8770 df-en 8889 df-dom 8890 df-sdom 8891 df-fin 8892 df-fsupp 9270 df-oi 9420 df-card 9858 df-pnf 11176 df-mnf 11177 df-xr 11178 df-ltxr 11179 df-le 11180 df-sub 11374 df-neg 11375 df-nn 12170 df-2 12239 df-n0 12433 df-z 12520 df-uz 12784 df-fz 13457 df-fzo 13604 df-seq 13959 df-hash 14288 df-sets 17129 df-slot 17147 df-ndx 17159 df-base 17175 df-plusg 17228 df-0g 17399 df-gsum 17400 df-mgm 18603 df-sgrp 18682 df-mnd 18698 df-mhm 18746 df-grp 18907 df-minusg 18908 df-ghm 19183 df-cntz 19287 df-cmn 19752 df-abl 19753 df-mgp 20117 df-ur 20158 df-ring 20211 df-lmod 20852 |
| This theorem is referenced by: frlmup1 21792 lincscm 48922 lincresunit3lem2 48972 |
| Copyright terms: Public domain | W3C validator |