lincscm - Mathbox for Alexander van der Vekens

	Mathbox for Alexander van der Vekens		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > lincscm		Structured version Visualization version GIF version

Theorem lincscm 47265

Description: A linear combinations multiplied with a scalar is a linear combination, see also the proof in [Lang] p. 129. (Contributed by AV, 9-Apr-2019.) (Revised by AV, 28-Jul-2019.)

**Hypotheses**
Ref	Expression
lincscm.s	⊢ ∙ = ( ·_𝑠 ‘𝑀)
lincscm.t	⊢ · = (._r‘(Scalar‘𝑀))
lincscm.x	⊢ 𝑋 = (𝐴( linC ‘𝑀)𝑉)
lincscm.r	⊢ 𝑅 = (Base‘(Scalar‘𝑀))
lincscm.f	⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ (𝑆 · (𝐴‘𝑥)))

**Assertion**
Ref	Expression
lincscm	⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → (𝑆 ∙ 𝑋) = (𝐹( linC ‘𝑀)𝑉))

Distinct variable groups: 𝑥,𝐴 𝑥,𝑀 𝑥,𝑅 𝑥,𝑆 𝑥,𝑉 𝑥, · Allowed substitution hints: ∙ (𝑥) 𝐹(𝑥) 𝑋(𝑥)

Proof of Theorem lincscm Dummy variable 𝑣 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2724	. . 3 ⊢ (Base‘𝑀) = (Base‘𝑀)
2		eqid 2724	. . 3 ⊢ (Scalar‘𝑀) = (Scalar‘𝑀)
3		lincscm.r	. . 3 ⊢ 𝑅 = (Base‘(Scalar‘𝑀))
4		eqid 2724	. . 3 ⊢ (0_g‘𝑀) = (0_g‘𝑀)
5		eqid 2724	. . 3 ⊢ (+_g‘𝑀) = (+_g‘𝑀)
6		lincscm.s	. . 3 ⊢ ∙ = ( ·_𝑠 ‘𝑀)
7		simp1l 1194	. . 3 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → 𝑀 ∈ LMod)
8		simpr 484	. . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → 𝑉 ∈ 𝒫 (Base‘𝑀))
9	8	3ad2ant1 1130	. . 3 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → 𝑉 ∈ 𝒫 (Base‘𝑀))
10		simpr 484	. . . 4 ⊢ ((𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) → 𝑆 ∈ 𝑅)
11	10	3ad2ant2 1131	. . 3 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → 𝑆 ∈ 𝑅)
12	7	adantr 480	. . . 4 ⊢ ((((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) ∧ 𝑣 ∈ 𝑉) → 𝑀 ∈ LMod)
13		elmapi 8838	. . . . . . . 8 ⊢ (𝐴 ∈ (𝑅 ↑_m 𝑉) → 𝐴:𝑉⟶𝑅)
14		ffvelcdm 7073	. . . . . . . . 9 ⊢ ((𝐴:𝑉⟶𝑅 ∧ 𝑣 ∈ 𝑉) → (𝐴‘𝑣) ∈ 𝑅)
15	14	ex 412	. . . . . . . 8 ⊢ (𝐴:𝑉⟶𝑅 → (𝑣 ∈ 𝑉 → (𝐴‘𝑣) ∈ 𝑅))
16	13, 15	syl 17	. . . . . . 7 ⊢ (𝐴 ∈ (𝑅 ↑_m 𝑉) → (𝑣 ∈ 𝑉 → (𝐴‘𝑣) ∈ 𝑅))
17	16	adantr 480	. . . . . 6 ⊢ ((𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) → (𝑣 ∈ 𝑉 → (𝐴‘𝑣) ∈ 𝑅))
18	17	3ad2ant2 1131	. . . . 5 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → (𝑣 ∈ 𝑉 → (𝐴‘𝑣) ∈ 𝑅))
19	18	imp 406	. . . 4 ⊢ ((((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) ∧ 𝑣 ∈ 𝑉) → (𝐴‘𝑣) ∈ 𝑅)
20		elelpwi 4604	. . . . . . . 8 ⊢ ((𝑣 ∈ 𝑉 ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → 𝑣 ∈ (Base‘𝑀))
21	20	expcom 413	. . . . . . 7 ⊢ (𝑉 ∈ 𝒫 (Base‘𝑀) → (𝑣 ∈ 𝑉 → 𝑣 ∈ (Base‘𝑀)))
22	21	adantl 481	. . . . . 6 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (𝑣 ∈ 𝑉 → 𝑣 ∈ (Base‘𝑀)))
23	22	3ad2ant1 1130	. . . . 5 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → (𝑣 ∈ 𝑉 → 𝑣 ∈ (Base‘𝑀)))
24	23	imp 406	. . . 4 ⊢ ((((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) ∧ 𝑣 ∈ 𝑉) → 𝑣 ∈ (Base‘𝑀))
25		eqid 2724	. . . . 5 ⊢ ( ·_𝑠 ‘𝑀) = ( ·_𝑠 ‘𝑀)
26	1, 2, 25, 3	lmodvscl 20709	. . . 4 ⊢ ((𝑀 ∈ LMod ∧ (𝐴‘𝑣) ∈ 𝑅 ∧ 𝑣 ∈ (Base‘𝑀)) → ((𝐴‘𝑣)( ·_𝑠 ‘𝑀)𝑣) ∈ (Base‘𝑀))
27	12, 19, 24, 26	syl3anc 1368	. . 3 ⊢ ((((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) ∧ 𝑣 ∈ 𝑉) → ((𝐴‘𝑣)( ·_𝑠 ‘𝑀)𝑣) ∈ (Base‘𝑀))
28	2, 3	scmfsupp 47209	. . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ 𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·_𝑠 ‘𝑀)𝑣)) finSupp (0_g‘𝑀))
29	28	3adant2r 1176	. . 3 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·_𝑠 ‘𝑀)𝑣)) finSupp (0_g‘𝑀))
30	1, 2, 3, 4, 5, 6, 7, 9, 11, 27, 29	gsumvsmul 20757	. 2 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → (𝑀 Σ_g (𝑣 ∈ 𝑉 ↦ (𝑆 ∙ ((𝐴‘𝑣)( ·_𝑠 ‘𝑀)𝑣)))) = (𝑆 ∙ (𝑀 Σ_g (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·_𝑠 ‘𝑀)𝑣)))))
31	2	lmodring 20699	. . . . . . . . . 10 ⊢ (𝑀 ∈ LMod → (Scalar‘𝑀) ∈ Ring)
32	31	adantr 480	. . . . . . . . 9 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (Scalar‘𝑀) ∈ Ring)
33	32	3ad2ant1 1130	. . . . . . . 8 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → (Scalar‘𝑀) ∈ Ring)
34	33	adantr 480	. . . . . . 7 ⊢ ((((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) ∧ 𝑥 ∈ 𝑉) → (Scalar‘𝑀) ∈ Ring)
35	3	eleq2i 2817	. . . . . . . . . . 11 ⊢ (𝑆 ∈ 𝑅 ↔ 𝑆 ∈ (Base‘(Scalar‘𝑀)))
36	35	biimpi 215	. . . . . . . . . 10 ⊢ (𝑆 ∈ 𝑅 → 𝑆 ∈ (Base‘(Scalar‘𝑀)))
37	36	adantl 481	. . . . . . . . 9 ⊢ ((𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) → 𝑆 ∈ (Base‘(Scalar‘𝑀)))
38	37	3ad2ant2 1131	. . . . . . . 8 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → 𝑆 ∈ (Base‘(Scalar‘𝑀)))
39	38	adantr 480	. . . . . . 7 ⊢ ((((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) ∧ 𝑥 ∈ 𝑉) → 𝑆 ∈ (Base‘(Scalar‘𝑀)))
40		ffvelcdm 7073	. . . . . . . . . . . . 13 ⊢ ((𝐴:𝑉⟶𝑅 ∧ 𝑥 ∈ 𝑉) → (𝐴‘𝑥) ∈ 𝑅)
41	40, 3	eleqtrdi 2835	. . . . . . . . . . . 12 ⊢ ((𝐴:𝑉⟶𝑅 ∧ 𝑥 ∈ 𝑉) → (𝐴‘𝑥) ∈ (Base‘(Scalar‘𝑀)))
42	41	ex 412	. . . . . . . . . . 11 ⊢ (𝐴:𝑉⟶𝑅 → (𝑥 ∈ 𝑉 → (𝐴‘𝑥) ∈ (Base‘(Scalar‘𝑀))))
43	13, 42	syl 17	. . . . . . . . . 10 ⊢ (𝐴 ∈ (𝑅 ↑_m 𝑉) → (𝑥 ∈ 𝑉 → (𝐴‘𝑥) ∈ (Base‘(Scalar‘𝑀))))
44	43	adantr 480	. . . . . . . . 9 ⊢ ((𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) → (𝑥 ∈ 𝑉 → (𝐴‘𝑥) ∈ (Base‘(Scalar‘𝑀))))
45	44	3ad2ant2 1131	. . . . . . . 8 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → (𝑥 ∈ 𝑉 → (𝐴‘𝑥) ∈ (Base‘(Scalar‘𝑀))))
46	45	imp 406	. . . . . . 7 ⊢ ((((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) ∧ 𝑥 ∈ 𝑉) → (𝐴‘𝑥) ∈ (Base‘(Scalar‘𝑀)))
47		eqid 2724	. . . . . . . 8 ⊢ (Base‘(Scalar‘𝑀)) = (Base‘(Scalar‘𝑀))
48		lincscm.t	. . . . . . . 8 ⊢ · = (._r‘(Scalar‘𝑀))
49	47, 48	ringcl 20140	. . . . . . 7 ⊢ (((Scalar‘𝑀) ∈ Ring ∧ 𝑆 ∈ (Base‘(Scalar‘𝑀)) ∧ (𝐴‘𝑥) ∈ (Base‘(Scalar‘𝑀))) → (𝑆 · (𝐴‘𝑥)) ∈ (Base‘(Scalar‘𝑀)))
50	34, 39, 46, 49	syl3anc 1368	. . . . . 6 ⊢ ((((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) ∧ 𝑥 ∈ 𝑉) → (𝑆 · (𝐴‘𝑥)) ∈ (Base‘(Scalar‘𝑀)))
51		lincscm.f	. . . . . 6 ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ (𝑆 · (𝐴‘𝑥)))
52	50, 51	fmptd 7105	. . . . 5 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → 𝐹:𝑉⟶(Base‘(Scalar‘𝑀)))
53		fvex 6894	. . . . . 6 ⊢ (Base‘(Scalar‘𝑀)) ∈ V
54		elmapg 8828	. . . . . 6 ⊢ (((Base‘(Scalar‘𝑀)) ∈ V ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ↔ 𝐹:𝑉⟶(Base‘(Scalar‘𝑀))))
55	53, 9, 54	sylancr 586	. . . . 5 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → (𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ↔ 𝐹:𝑉⟶(Base‘(Scalar‘𝑀))))
56	52, 55	mpbird 257	. . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → 𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉))
57		lincval 47244	. . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (𝐹( linC ‘𝑀)𝑉) = (𝑀 Σ_g (𝑣 ∈ 𝑉 ↦ ((𝐹‘𝑣)( ·_𝑠 ‘𝑀)𝑣))))
58	7, 56, 9, 57	syl3anc 1368	. . 3 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → (𝐹( linC ‘𝑀)𝑉) = (𝑀 Σ_g (𝑣 ∈ 𝑉 ↦ ((𝐹‘𝑣)( ·_𝑠 ‘𝑀)𝑣))))
59		simpr 484	. . . . . . . 8 ⊢ ((((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) ∧ 𝑣 ∈ 𝑉) → 𝑣 ∈ 𝑉)
60		ovex 7434	. . . . . . . 8 ⊢ (𝑆 · (𝐴‘𝑣)) ∈ V
61		fveq2 6881	. . . . . . . . . 10 ⊢ (𝑥 = 𝑣 → (𝐴‘𝑥) = (𝐴‘𝑣))
62	61	oveq2d 7417	. . . . . . . . 9 ⊢ (𝑥 = 𝑣 → (𝑆 · (𝐴‘𝑥)) = (𝑆 · (𝐴‘𝑣)))
63	62, 51	fvmptg 6986	. . . . . . . 8 ⊢ ((𝑣 ∈ 𝑉 ∧ (𝑆 · (𝐴‘𝑣)) ∈ V) → (𝐹‘𝑣) = (𝑆 · (𝐴‘𝑣)))
64	59, 60, 63	sylancl 585	. . . . . . 7 ⊢ ((((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) ∧ 𝑣 ∈ 𝑉) → (𝐹‘𝑣) = (𝑆 · (𝐴‘𝑣)))
65	64	oveq1d 7416	. . . . . 6 ⊢ ((((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) ∧ 𝑣 ∈ 𝑉) → ((𝐹‘𝑣)( ·_𝑠 ‘𝑀)𝑣) = ((𝑆 · (𝐴‘𝑣))( ·_𝑠 ‘𝑀)𝑣))
66	11	adantr 480	. . . . . . . 8 ⊢ ((((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) ∧ 𝑣 ∈ 𝑉) → 𝑆 ∈ 𝑅)
67	1, 2, 25, 3, 48	lmodvsass 20718	. . . . . . . 8 ⊢ ((𝑀 ∈ LMod ∧ (𝑆 ∈ 𝑅 ∧ (𝐴‘𝑣) ∈ 𝑅 ∧ 𝑣 ∈ (Base‘𝑀))) → ((𝑆 · (𝐴‘𝑣))( ·_𝑠 ‘𝑀)𝑣) = (𝑆( ·_𝑠 ‘𝑀)((𝐴‘𝑣)( ·_𝑠 ‘𝑀)𝑣)))
68	12, 66, 19, 24, 67	syl13anc 1369	. . . . . . 7 ⊢ ((((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) ∧ 𝑣 ∈ 𝑉) → ((𝑆 · (𝐴‘𝑣))( ·_𝑠 ‘𝑀)𝑣) = (𝑆( ·_𝑠 ‘𝑀)((𝐴‘𝑣)( ·_𝑠 ‘𝑀)𝑣)))
69	6	eqcomi 2733	. . . . . . . . 9 ⊢ ( ·_𝑠 ‘𝑀) = ∙
70	69	a1i 11	. . . . . . . 8 ⊢ ((((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) ∧ 𝑣 ∈ 𝑉) → ( ·_𝑠 ‘𝑀) = ∙ )
71	70	oveqd 7418	. . . . . . 7 ⊢ ((((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) ∧ 𝑣 ∈ 𝑉) → (𝑆( ·_𝑠 ‘𝑀)((𝐴‘𝑣)( ·_𝑠 ‘𝑀)𝑣)) = (𝑆 ∙ ((𝐴‘𝑣)( ·_𝑠 ‘𝑀)𝑣)))
72	68, 71	eqtrd 2764	. . . . . 6 ⊢ ((((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) ∧ 𝑣 ∈ 𝑉) → ((𝑆 · (𝐴‘𝑣))( ·_𝑠 ‘𝑀)𝑣) = (𝑆 ∙ ((𝐴‘𝑣)( ·_𝑠 ‘𝑀)𝑣)))
73	65, 72	eqtrd 2764	. . . . 5 ⊢ ((((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) ∧ 𝑣 ∈ 𝑉) → ((𝐹‘𝑣)( ·_𝑠 ‘𝑀)𝑣) = (𝑆 ∙ ((𝐴‘𝑣)( ·_𝑠 ‘𝑀)𝑣)))
74	73	mpteq2dva 5238	. . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → (𝑣 ∈ 𝑉 ↦ ((𝐹‘𝑣)( ·_𝑠 ‘𝑀)𝑣)) = (𝑣 ∈ 𝑉 ↦ (𝑆 ∙ ((𝐴‘𝑣)( ·_𝑠 ‘𝑀)𝑣))))
75	74	oveq2d 7417	. . 3 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → (𝑀 Σ_g (𝑣 ∈ 𝑉 ↦ ((𝐹‘𝑣)( ·_𝑠 ‘𝑀)𝑣))) = (𝑀 Σ_g (𝑣 ∈ 𝑉 ↦ (𝑆 ∙ ((𝐴‘𝑣)( ·_𝑠 ‘𝑀)𝑣)))))
76	58, 75	eqtrd 2764	. 2 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → (𝐹( linC ‘𝑀)𝑉) = (𝑀 Σ_g (𝑣 ∈ 𝑉 ↦ (𝑆 ∙ ((𝐴‘𝑣)( ·_𝑠 ‘𝑀)𝑣)))))
77		lincscm.x	. . . . 5 ⊢ 𝑋 = (𝐴( linC ‘𝑀)𝑉)
78	77	a1i 11	. . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → 𝑋 = (𝐴( linC ‘𝑀)𝑉))
79	3	oveq1i 7411	. . . . . . . . 9 ⊢ (𝑅 ↑_m 𝑉) = ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)
80	79	eleq2i 2817	. . . . . . . 8 ⊢ (𝐴 ∈ (𝑅 ↑_m 𝑉) ↔ 𝐴 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉))
81	80	biimpi 215	. . . . . . 7 ⊢ (𝐴 ∈ (𝑅 ↑_m 𝑉) → 𝐴 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉))
82	81	adantr 480	. . . . . 6 ⊢ ((𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) → 𝐴 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉))
83	82	3ad2ant2 1131	. . . . 5 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → 𝐴 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉))
84		lincval 47244	. . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝐴 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (𝐴( linC ‘𝑀)𝑉) = (𝑀 Σ_g (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·_𝑠 ‘𝑀)𝑣))))
85	7, 83, 9, 84	syl3anc 1368	. . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → (𝐴( linC ‘𝑀)𝑉) = (𝑀 Σ_g (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·_𝑠 ‘𝑀)𝑣))))
86	78, 85	eqtrd 2764	. . 3 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → 𝑋 = (𝑀 Σ_g (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·_𝑠 ‘𝑀)𝑣))))
87	86	oveq2d 7417	. 2 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → (𝑆 ∙ 𝑋) = (𝑆 ∙ (𝑀 Σ_g (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·_𝑠 ‘𝑀)𝑣)))))
88	30, 76, 87	3eqtr4rd 2775	1 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐴 ∈ (𝑅 ↑_m 𝑉) ∧ 𝑆 ∈ 𝑅) ∧ 𝐴 finSupp (0_g‘(Scalar‘𝑀))) → (𝑆 ∙ 𝑋) = (𝐹( linC ‘𝑀)𝑉))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 Vcvv 3466 𝒫 cpw 4594 class class class wbr 5138 ↦ cmpt 5221 ⟶wf 6529 ‘cfv 6533 (class class class)co 7401 ↑_m cmap 8815 finSupp cfsupp 9356 Basecbs 17140 +_gcplusg 17193 ._rcmulr 17194 Scalarcsca 17196 ·_𝑠 cvsca 17197 0_gc0g 17381 Σ_g cgsu 17382 Ringcrg 20123 LModclmod 20691 linC clinc 47239

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-rep 5275 ax-sep 5289 ax-nul 5296 ax-pow 5353 ax-pr 5417 ax-un 7718 ax-cnex 11161 ax-resscn 11162 ax-1cn 11163 ax-icn 11164 ax-addcl 11165 ax-addrcl 11166 ax-mulcl 11167 ax-mulrcl 11168 ax-mulcom 11169 ax-addass 11170 ax-mulass 11171 ax-distr 11172 ax-i2m1 11173 ax-1ne0 11174 ax-1rid 11175 ax-rnegex 11176 ax-rrecex 11177 ax-cnre 11178 ax-pre-lttri 11179 ax-pre-lttrn 11180 ax-pre-ltadd 11181 ax-pre-mulgt0 11182

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-nel 3039 df-ral 3054 df-rex 3063 df-rmo 3368 df-reu 3369 df-rab 3425 df-v 3468 df-sbc 3770 df-csb 3886 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-pss 3959 df-nul 4315 df-if 4521 df-pw 4596 df-sn 4621 df-pr 4623 df-op 4627 df-uni 4900 df-int 4941 df-iun 4989 df-br 5139 df-opab 5201 df-mpt 5222 df-tr 5256 df-id 5564 df-eprel 5570 df-po 5578 df-so 5579 df-fr 5621 df-se 5622 df-we 5623 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6290 df-ord 6357 df-on 6358 df-lim 6359 df-suc 6360 df-iota 6485 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-isom 6542 df-riota 7357 df-ov 7404 df-oprab 7405 df-mpo 7406 df-om 7849 df-1st 7968 df-2nd 7969 df-supp 8141 df-frecs 8261 df-wrecs 8292 df-recs 8366 df-rdg 8405 df-1o 8461 df-er 8698 df-map 8817 df-en 8935 df-dom 8936 df-sdom 8937 df-fin 8938 df-fsupp 9357 df-oi 9500 df-card 9929 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-nn 12209 df-2 12271 df-n0 12469 df-z 12555 df-uz 12819 df-fz 13481 df-fzo 13624 df-seq 13963 df-hash 14287 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17141 df-plusg 17206 df-0g 17383 df-gsum 17384 df-mgm 18560 df-sgrp 18639 df-mnd 18655 df-mhm 18700 df-grp 18853 df-minusg 18854 df-ghm 19124 df-cntz 19218 df-cmn 19687 df-abl 19688 df-mgp 20025 df-ur 20072 df-ring 20125 df-lmod 20693 df-linc 47241

This theorem is referenced by: lincscmcl 47267

W3C validator