lincsumcl - Mathbox for Alexander van der Vekens

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

Theorem lincsumcl 48593

Description: The sum of two linear combinations is a linear combination, see also the proof in [Lang] p. 129. (Contributed by AV, 4-Apr-2019.) (Proof shortened by AV, 28-Jul-2019.)

**Hypothesis**
Ref	Expression
lincsumcl.b	⊢ + = (+_g‘𝑀)

**Assertion**
Ref	Expression
lincsumcl	⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐶 ∈ (𝑀 LinCo 𝑉) ∧ 𝐷 ∈ (𝑀 LinCo 𝑉))) → (𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉))

Proof of Theorem lincsumcl Dummy variables 𝑠 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2733	. . . . 5 ⊢ (Base‘𝑀) = (Base‘𝑀)
2		eqid 2733	. . . . 5 ⊢ (Scalar‘𝑀) = (Scalar‘𝑀)
3		eqid 2733	. . . . 5 ⊢ (Base‘(Scalar‘𝑀)) = (Base‘(Scalar‘𝑀))
4	1, 2, 3	lcoval 48574	. . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (𝐶 ∈ (𝑀 LinCo 𝑉) ↔ (𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉)))))
5	1, 2, 3	lcoval 48574	. . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (𝐷 ∈ (𝑀 LinCo 𝑉) ↔ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))))
6	4, 5	anbi12d 632	. . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ((𝐶 ∈ (𝑀 LinCo 𝑉) ∧ 𝐷 ∈ (𝑀 LinCo 𝑉)) ↔ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))))
7		simpll 766	. . . . . 6 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → 𝑀 ∈ LMod)
8		simpll 766	. . . . . . 7 ⊢ (((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → 𝐶 ∈ (Base‘𝑀))
9	8	adantl 481	. . . . . 6 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → 𝐶 ∈ (Base‘𝑀))
10		simprl 770	. . . . . . 7 ⊢ (((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → 𝐷 ∈ (Base‘𝑀))
11	10	adantl 481	. . . . . 6 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → 𝐷 ∈ (Base‘𝑀))
12		lincsumcl.b	. . . . . . 7 ⊢ + = (+_g‘𝑀)
13	1, 12	lmodvacl 20817	. . . . . 6 ⊢ ((𝑀 ∈ LMod ∧ 𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀)) → (𝐶 + 𝐷) ∈ (Base‘𝑀))
14	7, 9, 11, 13	syl3anc 1373	. . . . 5 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → (𝐶 + 𝐷) ∈ (Base‘𝑀))
15	2	lmodfgrp 20811	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑀 ∈ LMod → (Scalar‘𝑀) ∈ Grp)
16	15	grpmndd 18867	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑀 ∈ LMod → (Scalar‘𝑀) ∈ Mnd)
17	16	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (Scalar‘𝑀) ∈ Mnd)
18	17	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (Scalar‘𝑀) ∈ Mnd)
19		simpr 484	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → 𝑉 ∈ 𝒫 (Base‘𝑀))
20	19	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → 𝑉 ∈ 𝒫 (Base‘𝑀))
21		simpll 766	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) → 𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉))
22		simpl 482	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉))
23	21, 22	anim12i 613	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → (𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)))
24	23	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)))
25		eqid 2733	. . . . . . . . . . . . . . . . 17 ⊢ (+_g‘(Scalar‘𝑀)) = (+_g‘(Scalar‘𝑀))
26	3, 25	ofaddmndmap 48505	. . . . . . . . . . . . . . . 16 ⊢ (((Scalar‘𝑀) ∈ Mnd ∧ 𝑉 ∈ 𝒫 (Base‘𝑀) ∧ (𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉))) → (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉))
27	18, 20, 24, 26	syl3anc 1373	. . . . . . . . . . . . . . 15 ⊢ (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉))
28	16	anim1i 615	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ((Scalar‘𝑀) ∈ Mnd ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)))
29	28	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → ((Scalar‘𝑀) ∈ Mnd ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)))
30		simprl 770	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → 𝑦 finSupp (0_g‘(Scalar‘𝑀)))
31	30	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) → 𝑦 finSupp (0_g‘(Scalar‘𝑀)))
32		simprl 770	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → 𝑥 finSupp (0_g‘(Scalar‘𝑀)))
33	31, 32	anim12i 613	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝑥 finSupp (0_g‘(Scalar‘𝑀))))
34	33	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝑥 finSupp (0_g‘(Scalar‘𝑀))))
35	3	mndpfsupp 18683	. . . . . . . . . . . . . . . 16 ⊢ ((((Scalar‘𝑀) ∈ Mnd ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝑥 finSupp (0_g‘(Scalar‘𝑀)))) → (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) finSupp (0_g‘(Scalar‘𝑀)))
36	29, 24, 34, 35	syl3anc 1373	. . . . . . . . . . . . . . 15 ⊢ (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) finSupp (0_g‘(Scalar‘𝑀)))
37		oveq12 7364	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝐶 = (𝑦( linC ‘𝑀)𝑉) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉)))
38	37	expcom 413	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐷 = (𝑥( linC ‘𝑀)𝑉) → (𝐶 = (𝑦( linC ‘𝑀)𝑉) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
39	38	adantl 481	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)) → (𝐶 = (𝑦( linC ‘𝑀)𝑉) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
40	39	adantl 481	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 = (𝑦( linC ‘𝑀)𝑉) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
41	40	com12 32	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝐶 = (𝑦( linC ‘𝑀)𝑉) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
42	41	adantl 481	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉)) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
43	42	adantl 481	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
44	43	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
45	44	imp 406	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉)))
46	45	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉)))
47		simpr 484	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)))
48		eqid 2733	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦( linC ‘𝑀)𝑉) = (𝑦( linC ‘𝑀)𝑉)
49		eqid 2733	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥( linC ‘𝑀)𝑉) = (𝑥( linC ‘𝑀)𝑉)
50	12, 48, 49, 2, 3, 25	lincsum 48591	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝑥 finSupp (0_g‘(Scalar‘𝑀)))) → ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉)) = ((𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉))
51	47, 24, 34, 50	syl3anc 1373	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉)) = ((𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉))
52	46, 51	eqtrd 2768	. . . . . . . . . . . . . . 15 ⊢ (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (𝐶 + 𝐷) = ((𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉))
53		breq1 5098	. . . . . . . . . . . . . . . . 17 ⊢ (𝑠 = (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) → (𝑠 finSupp (0_g‘(Scalar‘𝑀)) ↔ (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) finSupp (0_g‘(Scalar‘𝑀))))
54		oveq1 7362	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑠 = (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) → (𝑠( linC ‘𝑀)𝑉) = ((𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉))
55	54	eqeq2d 2744	. . . . . . . . . . . . . . . . 17 ⊢ (𝑠 = (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) → ((𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉) ↔ (𝐶 + 𝐷) = ((𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉)))
56	53, 55	anbi12d 632	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 = (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) → ((𝑠 finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)) ↔ ((𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = ((𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉))))
57	56	rspcev 3573	. . . . . . . . . . . . . . 15 ⊢ (((𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ ((𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = ((𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉))) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑠 finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)))
58	27, 36, 52, 57	syl12anc 836	. . . . . . . . . . . . . 14 ⊢ (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑠 finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)))
59	58	exp41 434	. . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → ((𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀)) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑠 finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉))))))
60	59	rexlimiva 3126	. . . . . . . . . . . 12 ⊢ (∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉)) → ((𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀)) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑠 finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉))))))
61	60	expd 415	. . . . . . . . . . 11 ⊢ (∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉)) → (𝐶 ∈ (Base‘𝑀) → (𝐷 ∈ (Base‘𝑀) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑠 finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)))))))
62	61	impcom 407	. . . . . . . . . 10 ⊢ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → (𝐷 ∈ (Base‘𝑀) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑠 finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉))))))
63	62	com13 88	. . . . . . . . 9 ⊢ ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐷 ∈ (Base‘𝑀) → ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑠 finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉))))))
64	63	rexlimiva 3126	. . . . . . . 8 ⊢ (∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)) → (𝐷 ∈ (Base‘𝑀) → ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑠 finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉))))))
65	64	impcom 407	. . . . . . 7 ⊢ ((𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑠 finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)))))
66	65	impcom 407	. . . . . 6 ⊢ (((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑠 finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉))))
67	66	impcom 407	. . . . 5 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑠 finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)))
68	1, 2, 3	lcoval 48574	. . . . . 6 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ((𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉) ↔ ((𝐶 + 𝐷) ∈ (Base‘𝑀) ∧ ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑠 finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)))))
69	68	adantr 480	. . . . 5 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → ((𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉) ↔ ((𝐶 + 𝐷) ∈ (Base‘𝑀) ∧ ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑠 finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)))))
70	14, 67, 69	mpbir2and 713	. . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → (𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉))
71	70	ex 412	. . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → (𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉)))
72	6, 71	sylbid 240	. 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ((𝐶 ∈ (𝑀 LinCo 𝑉) ∧ 𝐷 ∈ (𝑀 LinCo 𝑉)) → (𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉)))
73	72	imp 406	1 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐶 ∈ (𝑀 LinCo 𝑉) ∧ 𝐷 ∈ (𝑀 LinCo 𝑉))) → (𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∃wrex 3057 𝒫 cpw 4551 class class class wbr 5095 ‘cfv 6489 (class class class)co 7355 ∘_f cof 7617 ↑_m cmap 8759 finSupp cfsupp 9256 Basecbs 17127 +_gcplusg 17168 Scalarcsca 17171 0_gc0g 17350 Mndcmnd 18650 LModclmod 20802 linC clinc 48566 LinCo clinco 48567

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 ax-cnex 11073 ax-resscn 11074 ax-1cn 11075 ax-icn 11076 ax-addcl 11077 ax-addrcl 11078 ax-mulcl 11079 ax-mulrcl 11080 ax-mulcom 11081 ax-addass 11082 ax-mulass 11083 ax-distr 11084 ax-i2m1 11085 ax-1ne0 11086 ax-1rid 11087 ax-rnegex 11088 ax-rrecex 11089 ax-cnre 11090 ax-pre-lttri 11091 ax-pre-lttrn 11092 ax-pre-ltadd 11093 ax-pre-mulgt0 11094

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-int 4900 df-iun 4945 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-se 5575 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-isom 6498 df-riota 7312 df-ov 7358 df-oprab 7359 df-mpo 7360 df-of 7619 df-om 7806 df-1st 7930 df-2nd 7931 df-supp 8100 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-1o 8394 df-er 8631 df-map 8761 df-en 8880 df-dom 8881 df-sdom 8882 df-fin 8883 df-fsupp 9257 df-oi 9407 df-card 9843 df-pnf 11159 df-mnf 11160 df-xr 11161 df-ltxr 11162 df-le 11163 df-sub 11357 df-neg 11358 df-nn 12137 df-2 12199 df-n0 12393 df-z 12480 df-uz 12743 df-fz 13415 df-fzo 13562 df-seq 13916 df-hash 14245 df-sets 17082 df-slot 17100 df-ndx 17112 df-base 17128 df-ress 17149 df-plusg 17181 df-0g 17352 df-gsum 17353 df-mgm 18556 df-sgrp 18635 df-mnd 18651 df-submnd 18700 df-grp 18857 df-minusg 18858 df-cntz 19237 df-cmn 19702 df-abl 19703 df-mgp 20067 df-ur 20108 df-ring 20161 df-lmod 20804 df-linc 48568 df-lco 48569

This theorem is referenced by: lincsumscmcl 48595

W3C validator