| 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 20367, 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 20979 | . . 3 ⊢ (𝑅 ∈ LMod → 𝑅 ∈ CMnd) | |
| 5 | 3, 4 | syl 17 | . 2 ⊢ (𝜑 → 𝑅 ∈ CMnd) |
| 6 | cmnmnd 19839 | . . 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 20992 | . . . 4 ⊢ ((𝑅 ∈ LMod ∧ 𝑋 ∈ 𝐾) → (𝑦 ∈ 𝐵 ↦ (𝑋 · 𝑦)) ∈ (𝑅 GrpHom 𝑅)) |
| 14 | 3, 9, 13 | syl2anc 593 | . . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ (𝑋 · 𝑦)) ∈ (𝑅 GrpHom 𝑅)) |
| 15 | ghmmhm 19268 | . . 3 ⊢ ((𝑦 ∈ 𝐵 ↦ (𝑋 · 𝑦)) ∈ (𝑅 GrpHom 𝑅) → (𝑦 ∈ 𝐵 ↦ (𝑋 · 𝑦)) ∈ (𝑅 MndHom 𝑅)) | |
| 16 | 14, 15 | syl 17 | . 2 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ (𝑋 · 𝑦)) ∈ (𝑅 MndHom 𝑅)) |
| 17 | gsumvsmul.y | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑌 ∈ 𝐵) | |
| 18 | gsumvsmul.n | . 2 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝑌) finSupp 0 ) | |
| 19 | oveq2 7406 | . 2 ⊢ (𝑦 = 𝑌 → (𝑋 · 𝑦) = (𝑋 · 𝑌)) | |
| 20 | oveq2 7406 | . 2 ⊢ (𝑦 = (𝑅 Σg (𝑘 ∈ 𝐴 ↦ 𝑌)) → (𝑋 · 𝑦) = (𝑋 · (𝑅 Σg (𝑘 ∈ 𝐴 ↦ 𝑌)))) | |
| 21 | 1, 2, 5, 7, 8, 16, 17, 18, 19, 20 | gsummhm2 19981 | 1 ⊢ (𝜑 → (𝑅 Σg (𝑘 ∈ 𝐴 ↦ (𝑋 · 𝑌))) = (𝑋 · (𝑅 Σg (𝑘 ∈ 𝐴 ↦ 𝑌)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1562 ∈ wcel 2144 class class class wbr 5102 ↦ cmpt 5183 ‘cfv 6523 (class class class)co 7398 finSupp cfsupp 9309 Basecbs 17247 +gcplusg 17288 Scalarcsca 17291 ·𝑠 cvsca 17292 0gc0g 17470 Σg cgsu 17471 Mndcmnd 18770 MndHom cmhm 18817 GrpHom cghm 19255 CMndccmn 19822 LModclmod 20929 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-rep 5229 ax-sep 5248 ax-nul 5258 ax-pow 5324 ax-pr 5392 ax-un 7720 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5544 df-eprel 5549 df-po 5557 df-so 5558 df-fr 5602 df-se 5603 df-we 5604 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-pred 6290 df-ord 6351 df-on 6352 df-lim 6353 df-suc 6354 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-isom 6532 df-riota 7355 df-ov 7401 df-oprab 7402 df-mpo 7403 df-om 7849 df-1st 7972 df-2nd 7973 df-supp 8143 df-frecs 8264 df-wrecs 8295 df-recs 8344 df-rdg 8383 df-1o 8439 df-er 8680 df-map 8812 df-en 8930 df-dom 8931 df-sdom 8932 df-fin 8933 df-fsupp 9310 df-oi 9460 df-card 9899 df-pnf 11220 df-mnf 11221 df-xr 11222 df-ltxr 11223 df-le 11224 df-sub 11418 df-neg 11419 df-nn 12213 df-2 12282 df-n0 12484 df-z 12571 df-uz 12842 df-fz 13515 df-fzo 13662 df-seq 14017 df-hash 14346 df-sets 17202 df-slot 17220 df-ndx 17232 df-base 17248 df-plusg 17301 df-0g 17472 df-gsum 17473 df-mgm 18676 df-sgrp 18755 df-mnd 18771 df-mhm 18819 df-grp 18980 df-minusg 18981 df-ghm 19256 df-cntz 19359 df-cmn 19824 df-abl 19825 df-mgp 20189 df-ur 20234 df-ring 20287 df-lmod 20931 |
| This theorem is referenced by: frlmup1 21852 lincscm 49057 lincresunit3lem2 49107 |
| Copyright terms: Public domain | W3C validator |