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 49231

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 2763	. . . . 5 ⊢ (Base‘𝑀) = (Base‘𝑀)
2		eqid 2763	. . . . 5 ⊢ (Scalar‘𝑀) = (Scalar‘𝑀)
3		eqid 2763	. . . . 5 ⊢ (Base‘(Scalar‘𝑀)) = (Base‘(Scalar‘𝑀))
4	1, 2, 3	lcoval 49212	. . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (𝐶 ∈ (𝑀 LinCo 𝑉) ↔ (𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉)))))
5	1, 2, 3	lcoval 49212	. . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (𝐷 ∈ (𝑀 LinCo 𝑉) ↔ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))))
6	4, 5	anbi12d 643	. . 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 778	. . . . . 6 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → 𝑀 ∈ LMod)
8		simpll 778	. . . . . . 7 ⊢ (((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → 𝐶 ∈ (Base‘𝑀))
9	8	adantl 486	. . . . . 6 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → 𝐶 ∈ (Base‘𝑀))
10		simprl 782	. . . . . . 7 ⊢ (((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → 𝐷 ∈ (Base‘𝑀))
11	10	adantl 486	. . . . . 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 20996	. . . . . 6 ⊢ ((𝑀 ∈ LMod ∧ 𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀)) → (𝐶 + 𝐷) ∈ (Base‘𝑀))
14	7, 9, 11, 13	syl3anc 1398	. . . . 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 20990	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑀 ∈ LMod → (Scalar‘𝑀) ∈ Grp)
16	15	grpmndd 19008	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑀 ∈ LMod → (Scalar‘𝑀) ∈ Mnd)
17	16	adantr 485	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (Scalar‘𝑀) ∈ Mnd)
18	17	adantl 486	. . . . . . . . . . . . . . . 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 489	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → 𝑉 ∈ 𝒫 (Base‘𝑀))
20	19	adantl 486	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → 𝑉 ∈ 𝒫 (Base‘𝑀))
21		simpll 778	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) → 𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉))
22		simpl 487	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉))
23	21, 22	anim12i 624	. . . . . . . . . . . . . . . . 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 485	. . . . . . . . . . . . . . . 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 2763	. . . . . . . . . . . . . . . . 17 ⊢ (+_g‘(Scalar‘𝑀)) = (+_g‘(Scalar‘𝑀))
26	3, 25	ofaddmndmap 49143	. . . . . . . . . . . . . . . 16 ⊢ (((Scalar‘𝑀) ∈ Mnd ∧ 𝑉 ∈ 𝒫 (Base‘𝑀) ∧ (𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉))) → (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉))
27	18, 20, 24, 26	syl3anc 1398	. . . . . . . . . . . . . . 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 626	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ((Scalar‘𝑀) ∈ Mnd ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)))
29	28	adantl 486	. . . . . . . . . . . . . . . 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 782	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → 𝑦 finSupp (0_g‘(Scalar‘𝑀)))
31	30	adantr 485	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) → 𝑦 finSupp (0_g‘(Scalar‘𝑀)))
32		simprl 782	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → 𝑥 finSupp (0_g‘(Scalar‘𝑀)))
33	31, 32	anim12i 624	. . . . . . . . . . . . . . . . 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 485	. . . . . . . . . . . . . . . 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 18820	. . . . . . . . . . . . . . . 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 1398	. . . . . . . . . . . . . . 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 7419	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝐶 = (𝑦( linC ‘𝑀)𝑉) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉)))
38	37	expcom 418	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐷 = (𝑥( linC ‘𝑀)𝑉) → (𝐶 = (𝑦( linC ‘𝑀)𝑉) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
39	38	adantl 486	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)) → (𝐶 = (𝑦( linC ‘𝑀)𝑉) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
40	39	adantl 486	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 = (𝑦( linC ‘𝑀)𝑉) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
41	40	com12 33	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝐶 = (𝑦( linC ‘𝑀)𝑉) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
42	41	adantl 486	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉)) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
43	42	adantl 486	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
44	43	adantr 485	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
45	44	imp 411	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉)))
46	45	adantr 485	. . . . . . . . . . . . . . . 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 489	. . . . . . . . . . . . . . . . 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 2763	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦( linC ‘𝑀)𝑉) = (𝑦( linC ‘𝑀)𝑉)
49		eqid 2763	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥( linC ‘𝑀)𝑉) = (𝑥( linC ‘𝑀)𝑉)
50	12, 48, 49, 2, 3, 25	lincsum 49229	. . . . . . . . . . . . . . . . 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 1398	. . . . . . . . . . . . . . . 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 2798	. . . . . . . . . . . . . . 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 5112	. . . . . . . . . . . . . . . . 17 ⊢ (𝑠 = (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) → (𝑠 finSupp (0_g‘(Scalar‘𝑀)) ↔ (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) finSupp (0_g‘(Scalar‘𝑀))))
54		oveq1 7417	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑠 = (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) → (𝑠( linC ‘𝑀)𝑉) = ((𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉))
55	54	eqeq2d 2774	. . . . . . . . . . . . . . . . 17 ⊢ (𝑠 = (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) → ((𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉) ↔ (𝐶 + 𝐷) = ((𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉)))
56	53, 55	anbi12d 643	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 = (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) → ((𝑠 finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)) ↔ ((𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = ((𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉))))
57	56	rspcev 3581	. . . . . . . . . . . . . . 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 849	. . . . . . . . . . . . . 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 439	. . . . . . . . . . . . 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 3158	. . . . . . . . . . . 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 420	. . . . . . . . . . 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 412	. . . . . . . . . 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 89	. . . . . . . . 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 3158	. . . . . . . 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 412	. . . . . . 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 412	. . . . . 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 412	. . . . 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 49212	. . . . . 6 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ((𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉) ↔ ((𝐶 + 𝐷) ∈ (Base‘𝑀) ∧ ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑠 finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)))))
69	68	adantr 485	. . . . 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 725	. . . 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 417	. . 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 243	. 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ((𝐶 ∈ (𝑀 LinCo 𝑉) ∧ 𝐷 ∈ (𝑀 LinCo 𝑉)) → (𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉)))
73	72	imp 411	1 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐶 ∈ (𝑀 LinCo 𝑉) ∧ 𝐷 ∈ (𝑀 LinCo 𝑉))) → (𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∃wrex 3089 𝒫 cpw 4562 class class class wbr 5109 ‘cfv 6536 (class class class)co 7410 ∘_f cof 7672 ↑_m cmap 8820 finSupp cfsupp 9317 Basecbs 17264 +_gcplusg 17305 Scalarcsca 17308 0_gc0g 17487 Mndcmnd 18787 LModclmod 20981 linC clinc 49204 LinCo clinco 49205

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-se 5615 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-of 7674 df-om 7859 df-1st 7982 df-2nd 7983 df-supp 8153 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-er 8690 df-map 8822 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-fsupp 9318 df-oi 9468 df-card 9921 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-nn 12229 df-2 12298 df-n0 12500 df-z 12587 df-uz 12858 df-fz 13531 df-fzo 13679 df-seq 14034 df-hash 14363 df-sets 17219 df-slot 17237 df-ndx 17249 df-base 17265 df-ress 17286 df-plusg 17318 df-0g 17489 df-gsum 17490 df-mgm 18693 df-sgrp 18772 df-mnd 18788 df-submnd 18837 df-grp 18998 df-minusg 18999 df-cntz 19382 df-cmn 19847 df-abl 19848 df-mgp 20212 df-ur 20259 df-ring 20312 df-lmod 20983 df-linc 49206 df-lco 49207

This theorem is referenced by: lincsumscmcl 49233

W3C validator