| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > lincellss | Structured version Visualization version GIF version | ||
| Description: A linear combination of a subset of a linear subspace is also contained in the linear subspace. (Contributed by AV, 20-Apr-2019.) (Revised by AV, 28-Jul-2019.) |
| Ref | Expression |
|---|---|
| lincellss | ⊢ ((𝑀 ∈ LMod ∧ 𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) → ((𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝐹 finSupp (0g‘(Scalar‘𝑀))) → (𝐹( linC ‘𝑀)𝑉) ∈ 𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl1 1210 | . . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) ∧ (𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝐹 finSupp (0g‘(Scalar‘𝑀)))) → 𝑀 ∈ LMod) | |
| 2 | simprl 783 | . . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) ∧ (𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝐹 finSupp (0g‘(Scalar‘𝑀)))) → 𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)) | |
| 3 | ssexg 5285 | . . . . . . . 8 ⊢ ((𝑉 ⊆ 𝑆 ∧ 𝑆 ∈ (LSubSp‘𝑀)) → 𝑉 ∈ V) | |
| 4 | 3 | ancoms 464 | . . . . . . 7 ⊢ ((𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) → 𝑉 ∈ V) |
| 5 | eqid 2763 | . . . . . . . . . 10 ⊢ (Base‘𝑀) = (Base‘𝑀) | |
| 6 | eqid 2763 | . . . . . . . . . 10 ⊢ (LSubSp‘𝑀) = (LSubSp‘𝑀) | |
| 7 | 5, 6 | lssss 21226 | . . . . . . . . 9 ⊢ (𝑆 ∈ (LSubSp‘𝑀) → 𝑆 ⊆ (Base‘𝑀)) |
| 8 | sstr 3921 | . . . . . . . . . . 11 ⊢ ((𝑉 ⊆ 𝑆 ∧ 𝑆 ⊆ (Base‘𝑀)) → 𝑉 ⊆ (Base‘𝑀)) | |
| 9 | elpwg 4563 | . . . . . . . . . . 11 ⊢ (𝑉 ∈ V → (𝑉 ∈ 𝒫 (Base‘𝑀) ↔ 𝑉 ⊆ (Base‘𝑀))) | |
| 10 | 8, 9 | syl5ibrcom 250 | . . . . . . . . . 10 ⊢ ((𝑉 ⊆ 𝑆 ∧ 𝑆 ⊆ (Base‘𝑀)) → (𝑉 ∈ V → 𝑉 ∈ 𝒫 (Base‘𝑀))) |
| 11 | 10 | expcom 419 | . . . . . . . . 9 ⊢ (𝑆 ⊆ (Base‘𝑀) → (𝑉 ⊆ 𝑆 → (𝑉 ∈ V → 𝑉 ∈ 𝒫 (Base‘𝑀)))) |
| 12 | 7, 11 | syl 18 | . . . . . . . 8 ⊢ (𝑆 ∈ (LSubSp‘𝑀) → (𝑉 ⊆ 𝑆 → (𝑉 ∈ V → 𝑉 ∈ 𝒫 (Base‘𝑀)))) |
| 13 | 12 | imp 412 | . . . . . . 7 ⊢ ((𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) → (𝑉 ∈ V → 𝑉 ∈ 𝒫 (Base‘𝑀))) |
| 14 | 4, 13 | mpd 16 | . . . . . 6 ⊢ ((𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) → 𝑉 ∈ 𝒫 (Base‘𝑀)) |
| 15 | 14 | 3adant1 1148 | . . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) → 𝑉 ∈ 𝒫 (Base‘𝑀)) |
| 16 | 15 | adantr 486 | . . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) ∧ (𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝐹 finSupp (0g‘(Scalar‘𝑀)))) → 𝑉 ∈ 𝒫 (Base‘𝑀)) |
| 17 | lincval 49663 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (𝐹( linC ‘𝑀)𝑉) = (𝑀 Σg (𝑣 ∈ 𝑉 ↦ ((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣)))) | |
| 18 | 1, 2, 16, 17 | syl3anc 1398 | . . 3 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) ∧ (𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝐹 finSupp (0g‘(Scalar‘𝑀)))) → (𝐹( linC ‘𝑀)𝑉) = (𝑀 Σg (𝑣 ∈ 𝑉 ↦ ((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣)))) |
| 19 | eqid 2763 | . . . . 5 ⊢ (Scalar‘𝑀) = (Scalar‘𝑀) | |
| 20 | eqid 2763 | . . . . 5 ⊢ (Base‘(Scalar‘𝑀)) = (Base‘(Scalar‘𝑀)) | |
| 21 | 6, 19, 20 | gsumlsscl 49634 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) → ((𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝐹 finSupp (0g‘(Scalar‘𝑀))) → (𝑀 Σg (𝑣 ∈ 𝑉 ↦ ((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣))) ∈ 𝑆)) |
| 22 | 21 | imp 412 | . . 3 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) ∧ (𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝐹 finSupp (0g‘(Scalar‘𝑀)))) → (𝑀 Σg (𝑣 ∈ 𝑉 ↦ ((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣))) ∈ 𝑆) |
| 23 | 18, 22 | eqeltrd 2864 | . 2 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) ∧ (𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝐹 finSupp (0g‘(Scalar‘𝑀)))) → (𝐹( linC ‘𝑀)𝑉) ∈ 𝑆) |
| 24 | 23 | ex 418 | 1 ⊢ ((𝑀 ∈ LMod ∧ 𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) → ((𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝐹 finSupp (0g‘(Scalar‘𝑀))) → (𝐹( linC ‘𝑀)𝑉) ∈ 𝑆)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2146 Vcvv 3454 ⊆ wss 3900 𝒫 cpw 4560 class class class wbr 5106 ↦ cmpt 5189 ‘cfv 6547 (class class class)co 7430 ↑m cmap 8861 finSupp cfsupp 9367 Basecbs 17402 Scalarcsca 17446 ·𝑠 cvsca 17447 0gc0g 17625 Σg cgsu 17626 LModclmod 21150 LSubSpclss 21221 linC clinc 49658 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7761 ax-cnex 11269 ax-resscn 11270 ax-1cn 11271 ax-icn 11272 ax-addcl 11273 ax-addrcl 11274 ax-mulcl 11275 ax-mulrcl 11276 ax-mulcom 11277 ax-addass 11278 ax-mulass 11279 ax-distr 11280 ax-i2m1 11281 ax-1ne0 11282 ax-1rid 11283 ax-rnegex 11284 ax-rrecex 11285 ax-cnre 11286 ax-pre-lttri 11287 ax-pre-lttrn 11288 ax-pre-ltadd 11289 ax-pre-mulgt0 11290 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6311 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6501 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-isom 6556 df-riota 7387 df-ov 7433 df-oprab 7434 df-mpo 7435 df-om 7888 df-1st 8011 df-2nd 8012 df-supp 8191 df-frecs 8313 df-wrecs 8344 df-recs 8393 df-rdg 8432 df-1o 8490 df-er 8731 df-map 8863 df-en 8988 df-dom 8989 df-sdom 8990 df-fin 8991 df-fsupp 9368 df-oi 9517 df-card 10033 df-pnf 11358 df-mnf 11359 df-xr 11360 df-ltxr 11361 df-le 11362 df-sub 11556 df-neg 11557 df-nn 12349 df-2 12418 df-n0 12620 df-z 12707 df-uz 12979 df-fz 13653 df-fzo 13802 df-seq 14158 df-hash 14488 df-sets 17357 df-slot 17375 df-ndx 17387 df-base 17403 df-ress 17424 df-plusg 17456 df-0g 17627 df-gsum 17628 df-mgm 18831 df-sgrp 18923 df-mnd 18939 df-submnd 18994 df-grp 19162 df-minusg 19163 df-sbg 19164 df-subg 19348 df-cntz 19546 df-cmn 20011 df-abl 20012 df-mgp 20376 df-ur 20423 df-ring 20476 df-lmod 21152 df-lss 21222 df-linc 49660 |
| This theorem is used by: ellcoellss 49689 |
| Copyright terms: Public domain | W3C validator |