| 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 1192 | . . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) ∧ (𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝐹 finSupp (0g‘(Scalar‘𝑀)))) → 𝑀 ∈ LMod) | |
| 2 | simprl 771 | . . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) ∧ (𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝐹 finSupp (0g‘(Scalar‘𝑀)))) → 𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)) | |
| 3 | ssexg 5323 | . . . . . . . 8 ⊢ ((𝑉 ⊆ 𝑆 ∧ 𝑆 ∈ (LSubSp‘𝑀)) → 𝑉 ∈ V) | |
| 4 | 3 | ancoms 458 | . . . . . . 7 ⊢ ((𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) → 𝑉 ∈ V) |
| 5 | eqid 2737 | . . . . . . . . . 10 ⊢ (Base‘𝑀) = (Base‘𝑀) | |
| 6 | eqid 2737 | . . . . . . . . . 10 ⊢ (LSubSp‘𝑀) = (LSubSp‘𝑀) | |
| 7 | 5, 6 | lssss 20934 | . . . . . . . . 9 ⊢ (𝑆 ∈ (LSubSp‘𝑀) → 𝑆 ⊆ (Base‘𝑀)) |
| 8 | sstr 3992 | . . . . . . . . . . 11 ⊢ ((𝑉 ⊆ 𝑆 ∧ 𝑆 ⊆ (Base‘𝑀)) → 𝑉 ⊆ (Base‘𝑀)) | |
| 9 | elpwg 4603 | . . . . . . . . . . 11 ⊢ (𝑉 ∈ V → (𝑉 ∈ 𝒫 (Base‘𝑀) ↔ 𝑉 ⊆ (Base‘𝑀))) | |
| 10 | 8, 9 | syl5ibrcom 247 | . . . . . . . . . 10 ⊢ ((𝑉 ⊆ 𝑆 ∧ 𝑆 ⊆ (Base‘𝑀)) → (𝑉 ∈ V → 𝑉 ∈ 𝒫 (Base‘𝑀))) |
| 11 | 10 | expcom 413 | . . . . . . . . 9 ⊢ (𝑆 ⊆ (Base‘𝑀) → (𝑉 ⊆ 𝑆 → (𝑉 ∈ V → 𝑉 ∈ 𝒫 (Base‘𝑀)))) |
| 12 | 7, 11 | syl 17 | . . . . . . . 8 ⊢ (𝑆 ∈ (LSubSp‘𝑀) → (𝑉 ⊆ 𝑆 → (𝑉 ∈ V → 𝑉 ∈ 𝒫 (Base‘𝑀)))) |
| 13 | 12 | imp 406 | . . . . . . 7 ⊢ ((𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) → (𝑉 ∈ V → 𝑉 ∈ 𝒫 (Base‘𝑀))) |
| 14 | 4, 13 | mpd 15 | . . . . . 6 ⊢ ((𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) → 𝑉 ∈ 𝒫 (Base‘𝑀)) |
| 15 | 14 | 3adant1 1131 | . . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) → 𝑉 ∈ 𝒫 (Base‘𝑀)) |
| 16 | 15 | adantr 480 | . . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) ∧ (𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝐹 finSupp (0g‘(Scalar‘𝑀)))) → 𝑉 ∈ 𝒫 (Base‘𝑀)) |
| 17 | lincval 48326 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (𝐹( linC ‘𝑀)𝑉) = (𝑀 Σg (𝑣 ∈ 𝑉 ↦ ((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣)))) | |
| 18 | 1, 2, 16, 17 | syl3anc 1373 | . . 3 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) ∧ (𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝐹 finSupp (0g‘(Scalar‘𝑀)))) → (𝐹( linC ‘𝑀)𝑉) = (𝑀 Σg (𝑣 ∈ 𝑉 ↦ ((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣)))) |
| 19 | eqid 2737 | . . . . 5 ⊢ (Scalar‘𝑀) = (Scalar‘𝑀) | |
| 20 | eqid 2737 | . . . . 5 ⊢ (Base‘(Scalar‘𝑀)) = (Base‘(Scalar‘𝑀)) | |
| 21 | 6, 19, 20 | gsumlsscl 48296 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) → ((𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝐹 finSupp (0g‘(Scalar‘𝑀))) → (𝑀 Σg (𝑣 ∈ 𝑉 ↦ ((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣))) ∈ 𝑆)) |
| 22 | 21 | imp 406 | . . 3 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) ∧ (𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝐹 finSupp (0g‘(Scalar‘𝑀)))) → (𝑀 Σg (𝑣 ∈ 𝑉 ↦ ((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣))) ∈ 𝑆) |
| 23 | 18, 22 | eqeltrd 2841 | . 2 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) ∧ (𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝐹 finSupp (0g‘(Scalar‘𝑀)))) → (𝐹( linC ‘𝑀)𝑉) ∈ 𝑆) |
| 24 | 23 | ex 412 | 1 ⊢ ((𝑀 ∈ LMod ∧ 𝑆 ∈ (LSubSp‘𝑀) ∧ 𝑉 ⊆ 𝑆) → ((𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝐹 finSupp (0g‘(Scalar‘𝑀))) → (𝐹( linC ‘𝑀)𝑉) ∈ 𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1540 ∈ wcel 2108 Vcvv 3480 ⊆ wss 3951 𝒫 cpw 4600 class class class wbr 5143 ↦ cmpt 5225 ‘cfv 6561 (class class class)co 7431 ↑m cmap 8866 finSupp cfsupp 9401 Basecbs 17247 Scalarcsca 17300 ·𝑠 cvsca 17301 0gc0g 17484 Σg cgsu 17485 LModclmod 20858 LSubSpclss 20929 linC clinc 48321 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 ax-cnex 11211 ax-resscn 11212 ax-1cn 11213 ax-icn 11214 ax-addcl 11215 ax-addrcl 11216 ax-mulcl 11217 ax-mulrcl 11218 ax-mulcom 11219 ax-addass 11220 ax-mulass 11221 ax-distr 11222 ax-i2m1 11223 ax-1ne0 11224 ax-1rid 11225 ax-rnegex 11226 ax-rrecex 11227 ax-cnre 11228 ax-pre-lttri 11229 ax-pre-lttrn 11230 ax-pre-ltadd 11231 ax-pre-mulgt0 11232 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3380 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-int 4947 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-se 5638 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-lim 6389 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-isom 6570 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8014 df-2nd 8015 df-supp 8186 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-1o 8506 df-er 8745 df-map 8868 df-en 8986 df-dom 8987 df-sdom 8988 df-fin 8989 df-fsupp 9402 df-oi 9550 df-card 9979 df-pnf 11297 df-mnf 11298 df-xr 11299 df-ltxr 11300 df-le 11301 df-sub 11494 df-neg 11495 df-nn 12267 df-2 12329 df-n0 12527 df-z 12614 df-uz 12879 df-fz 13548 df-fzo 13695 df-seq 14043 df-hash 14370 df-sets 17201 df-slot 17219 df-ndx 17231 df-base 17248 df-ress 17275 df-plusg 17310 df-0g 17486 df-gsum 17487 df-mgm 18653 df-sgrp 18732 df-mnd 18748 df-submnd 18797 df-grp 18954 df-minusg 18955 df-sbg 18956 df-subg 19141 df-cntz 19335 df-cmn 19800 df-abl 19801 df-mgp 20138 df-ur 20179 df-ring 20232 df-lmod 20860 df-lss 20930 df-linc 48323 |
| This theorem is referenced by: ellcoellss 48352 |
| Copyright terms: Public domain | W3C validator |