Metamath Proof Explorer


Theorem lincfsuppcl

Description: A linear combination of vectors (with finite support) is a vector. (Contributed by AV, 25-Apr-2019) (Revised by AV, 28-Jul-2019)

Ref Expression
Hypotheses lincfsuppcl.b ⊢ B = Base M
lincfsuppcl.r ⊢ R = Scalar ⁡ M
lincfsuppcl.s ⊢ S = Base R
lincfsuppcl.0 ⊢ 0 ˙ = 0 R
Assertion lincfsuppcl ⊢ M ∈ LMod ∧ V ∈ W ∧ V ⊆ B ∧ F ∈ S V ∧ finSupp 0 ˙⁡ F → F linC ⁡ M V ∈ B

Proof

Step Hyp Ref Expression
1 lincfsuppcl.b ⊢ B = Base M
2 lincfsuppcl.r ⊢ R = Scalar ⁡ M
3 lincfsuppcl.s ⊢ S = Base R
4 lincfsuppcl.0 ⊢ 0 ˙ = 0 R
5 simp1 ⊢ M ∈ LMod ∧ V ∈ W ∧ V ⊆ B ∧ F ∈ S V ∧ finSupp 0 ˙⁡ F → M ∈ LMod
6 2 fveq2i ⊢ Base R = Base Scalar ⁡ M
7 3 6 eqtri ⊢ S = Base Scalar ⁡ M
8 7 oveq1i ⊢ S V = Base Scalar ⁡ M V
9 8 eleq2i ⊢ F ∈ S V ↔ F ∈ Base Scalar ⁡ M V
10 9 birani ⊢ F ∈ S V ∧ finSupp 0 ˙⁡ F → F ∈ Base Scalar ⁡ M V
11 10 3ad2ant3 ⊢ M ∈ LMod ∧ V ∈ W ∧ V ⊆ B ∧ F ∈ S V ∧ finSupp 0 ˙⁡ F → F ∈ Base Scalar ⁡ M V
12 elpwg ⊢ V ∈ W → V ∈ 𝒫 Base M ↔ V ⊆ Base M
13 1 a1i ⊢ V ∈ W → B = Base M
14 13 eqcomd ⊢ V ∈ W → Base M = B
15 14 sseq2d ⊢ V ∈ W → V ⊆ Base M ↔ V ⊆ B
16 12 15 bitr2d ⊢ V ∈ W → V ⊆ B ↔ V ∈ 𝒫 Base M
17 16 biimpa ⊢ V ∈ W ∧ V ⊆ B → V ∈ 𝒫 Base M
18 17 3ad2ant2 ⊢ M ∈ LMod ∧ V ∈ W ∧ V ⊆ B ∧ F ∈ S V ∧ finSupp 0 ˙⁡ F → V ∈ 𝒫 Base M
19 lincval ⊢ M ∈ LMod ∧ F ∈ Base Scalar ⁡ M V ∧ V ∈ 𝒫 Base M → F linC ⁡ M V = ∑ M v ∈ V F ⁡ v ⋅ M v
20 5 11 18 19 syl3anc ⊢ M ∈ LMod ∧ V ∈ W ∧ V ⊆ B ∧ F ∈ S V ∧ finSupp 0 ˙⁡ F → F linC ⁡ M V = ∑ M v ∈ V F ⁡ v ⋅ M v
21 eqid ⊢ 0 M = 0 M
22 lmodcmn ⊢ M ∈ LMod → M ∈ CMnd
23 22 3ad2ant1 ⊢ M ∈ LMod ∧ V ∈ W ∧ V ⊆ B ∧ F ∈ S V ∧ finSupp 0 ˙⁡ F → M ∈ CMnd
24 simpl ⊢ V ∈ W ∧ V ⊆ B → V ∈ W
25 24 3ad2ant2 ⊢ M ∈ LMod ∧ V ∈ W ∧ V ⊆ B ∧ F ∈ S V ∧ finSupp 0 ˙⁡ F → V ∈ W
26 5 adantr ⊢ M ∈ LMod ∧ V ∈ W ∧ V ⊆ B ∧ F ∈ S V ∧ finSupp 0 ˙⁡ F ∧ v ∈ V → M ∈ LMod
27 elmapi ⊢ F ∈ S V → F : V ⟶ S
28 ffvelcdm ⊢ F : V ⟶ S ∧ v ∈ V → F ⁡ v ∈ S
29 28 ex ⊢ F : V ⟶ S → v ∈ V → F ⁡ v ∈ S
30 27 29 syl ⊢ F ∈ S V → v ∈ V → F ⁡ v ∈ S
31 30 adantr ⊢ F ∈ S V ∧ finSupp 0 ˙⁡ F → v ∈ V → F ⁡ v ∈ S
32 31 3ad2ant3 ⊢ M ∈ LMod ∧ V ∈ W ∧ V ⊆ B ∧ F ∈ S V ∧ finSupp 0 ˙⁡ F → v ∈ V → F ⁡ v ∈ S
33 32 imp ⊢ M ∈ LMod ∧ V ∈ W ∧ V ⊆ B ∧ F ∈ S V ∧ finSupp 0 ˙⁡ F ∧ v ∈ V → F ⁡ v ∈ S
34 ssel ⊢ V ⊆ B → v ∈ V → v ∈ B
35 34 adantl ⊢ V ∈ W ∧ V ⊆ B → v ∈ V → v ∈ B
36 35 3ad2ant2 ⊢ M ∈ LMod ∧ V ∈ W ∧ V ⊆ B ∧ F ∈ S V ∧ finSupp 0 ˙⁡ F → v ∈ V → v ∈ B
37 36 imp ⊢ M ∈ LMod ∧ V ∈ W ∧ V ⊆ B ∧ F ∈ S V ∧ finSupp 0 ˙⁡ F ∧ v ∈ V → v ∈ B
38 eqid ⊢ ⋅ M = ⋅ M
39 1 2 38 3 lmodvscl ⊢ M ∈ LMod ∧ F ⁡ v ∈ S ∧ v ∈ B → F ⁡ v ⋅ M v ∈ B
40 26 33 37 39 syl3anc ⊢ M ∈ LMod ∧ V ∈ W ∧ V ⊆ B ∧ F ∈ S V ∧ finSupp 0 ˙⁡ F ∧ v ∈ V → F ⁡ v ⋅ M v ∈ B
41 40 fmpttd ⊢ M ∈ LMod ∧ V ∈ W ∧ V ⊆ B ∧ F ∈ S V ∧ finSupp 0 ˙⁡ F → v ∈ V ⟼ F ⁡ v ⋅ M v : V ⟶ B
42 simpl ⊢ F ∈ S V ∧ finSupp 0 ˙⁡ F → F ∈ S V
43 42 3ad2ant3 ⊢ M ∈ LMod ∧ V ∈ W ∧ V ⊆ B ∧ F ∈ S V ∧ finSupp 0 ˙⁡ F → F ∈ S V
44 simp3r ⊢ M ∈ LMod ∧ V ∈ W ∧ V ⊆ B ∧ F ∈ S V ∧ finSupp 0 ˙⁡ F → finSupp 0 ˙⁡ F
45 44 4 breqtrdi ⊢ M ∈ LMod ∧ V ∈ W ∧ V ⊆ B ∧ F ∈ S V ∧ finSupp 0 ˙⁡ F → finSupp 0 R⁡ F
46 2 3 scmfsupp ⊢ M ∈ LMod ∧ V ∈ 𝒫 Base M ∧ F ∈ S V ∧ finSupp 0 R⁡ F → finSupp 0 M⁡ v ∈ V ⟼ F ⁡ v ⋅ M v
47 5 18 43 45 46 syl211anc ⊢ M ∈ LMod ∧ V ∈ W ∧ V ⊆ B ∧ F ∈ S V ∧ finSupp 0 ˙⁡ F → finSupp 0 M⁡ v ∈ V ⟼ F ⁡ v ⋅ M v
48 1 21 23 25 41 47 gsumcl ⊢ M ∈ LMod ∧ V ∈ W ∧ V ⊆ B ∧ F ∈ S V ∧ finSupp 0 ˙⁡ F → ∑ M v ∈ V F ⁡ v ⋅ M v ∈ B
49 20 48 eqeltrd ⊢ M ∈ LMod ∧ V ∈ W ∧ V ⊆ B ∧ F ∈ S V ∧ finSupp 0 ˙⁡ F → F linC ⁡ M V ∈ B