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 45772

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 2738	. . . . 5 ⊢ (Base‘𝑀) = (Base‘𝑀)
2		eqid 2738	. . . . 5 ⊢ (Scalar‘𝑀) = (Scalar‘𝑀)
3		eqid 2738	. . . . 5 ⊢ (Base‘(Scalar‘𝑀)) = (Base‘(Scalar‘𝑀))
4	1, 2, 3	lcoval 45753	. . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (𝐶 ∈ (𝑀 LinCo 𝑉) ↔ (𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉)))))
5	1, 2, 3	lcoval 45753	. . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (𝐷 ∈ (𝑀 LinCo 𝑉) ↔ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))))
6	4, 5	anbi12d 631	. . 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 764	. . . . . 6 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → 𝑀 ∈ LMod)
8		simpll 764	. . . . . . 7 ⊢ (((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → 𝐶 ∈ (Base‘𝑀))
9	8	adantl 482	. . . . . 6 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → 𝐶 ∈ (Base‘𝑀))
10		simprl 768	. . . . . . 7 ⊢ (((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → 𝐷 ∈ (Base‘𝑀))
11	10	adantl 482	. . . . . 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 20137	. . . . . 6 ⊢ ((𝑀 ∈ LMod ∧ 𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀)) → (𝐶 + 𝐷) ∈ (Base‘𝑀))
14	7, 9, 11, 13	syl3anc 1370	. . . . 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 20132	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑀 ∈ LMod → (Scalar‘𝑀) ∈ Grp)
16	15	grpmndd 18589	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑀 ∈ LMod → (Scalar‘𝑀) ∈ Mnd)
17	16	adantr 481	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (Scalar‘𝑀) ∈ Mnd)
18	17	adantl 482	. . . . . . . . . . . . . . . 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 485	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → 𝑉 ∈ 𝒫 (Base‘𝑀))
20	19	adantl 482	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → 𝑉 ∈ 𝒫 (Base‘𝑀))
21		simpll 764	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) → 𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉))
22		simpl 483	. . . . . . . . . . . . . . . . . 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 481	. . . . . . . . . . . . . . . 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 2738	. . . . . . . . . . . . . . . . 17 ⊢ (+_g‘(Scalar‘𝑀)) = (+_g‘(Scalar‘𝑀))
26	3, 25	ofaddmndmap 45679	. . . . . . . . . . . . . . . 16 ⊢ (((Scalar‘𝑀) ∈ Mnd ∧ 𝑉 ∈ 𝒫 (Base‘𝑀) ∧ (𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉))) → (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉))
27	18, 20, 24, 26	syl3anc 1370	. . . . . . . . . . . . . . 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 482	. . . . . . . . . . . . . . . 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 768	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → 𝑦 finSupp (0_g‘(Scalar‘𝑀)))
31	30	adantr 481	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) → 𝑦 finSupp (0_g‘(Scalar‘𝑀)))
32		simprl 768	. . . . . . . . . . . . . . . . . 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 481	. . . . . . . . . . . . . . . 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 45712	. . . . . . . . . . . . . . . 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 1370	. . . . . . . . . . . . . . 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 7284	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝐶 = (𝑦( linC ‘𝑀)𝑉) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉)))
38	37	expcom 414	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐷 = (𝑥( linC ‘𝑀)𝑉) → (𝐶 = (𝑦( linC ‘𝑀)𝑉) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
39	38	adantl 482	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)) → (𝐶 = (𝑦( linC ‘𝑀)𝑉) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
40	39	adantl 482	. . . . . . . . . . . . . . . . . . . . . 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 482	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉)) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
43	42	adantl 482	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
44	43	adantr 481	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
45	44	imp 407	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑦 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉) ∧ (𝑥 finSupp (0_g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉)))
46	45	adantr 481	. . . . . . . . . . . . . . . 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 485	. . . . . . . . . . . . . . . . 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 2738	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦( linC ‘𝑀)𝑉) = (𝑦( linC ‘𝑀)𝑉)
49		eqid 2738	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥( linC ‘𝑀)𝑉) = (𝑥( linC ‘𝑀)𝑉)
50	12, 48, 49, 2, 3, 25	lincsum 45770	. . . . . . . . . . . . . . . . 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 1370	. . . . . . . . . . . . . . . 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 2778	. . . . . . . . . . . . . . 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 5077	. . . . . . . . . . . . . . . . 17 ⊢ (𝑠 = (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) → (𝑠 finSupp (0_g‘(Scalar‘𝑀)) ↔ (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) finSupp (0_g‘(Scalar‘𝑀))))
54		oveq1 7282	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑠 = (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) → (𝑠( linC ‘𝑀)𝑉) = ((𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉))
55	54	eqeq2d 2749	. . . . . . . . . . . . . . . . 17 ⊢ (𝑠 = (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) → ((𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉) ↔ (𝐶 + 𝐷) = ((𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉)))
56	53, 55	anbi12d 631	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 = (𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) → ((𝑠 finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)) ↔ ((𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥) finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = ((𝑦 ∘_f (+_g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉))))
57	56	rspcev 3561	. . . . . . . . . . . . . . 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 834	. . . . . . . . . . . . . 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 435	. . . . . . . . . . . . 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 3210	. . . . . . . . . . . 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 416	. . . . . . . . . . 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 408	. . . . . . . . . 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 3210	. . . . . . . 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 408	. . . . . . 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 408	. . . . . 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 408	. . . . 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 45753	. . . . . 6 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ((𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉) ↔ ((𝐶 + 𝐷) ∈ (Base‘𝑀) ∧ ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑉)(𝑠 finSupp (0_g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)))))
69	68	adantr 481	. . . . 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 710	. . . 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 413	. . 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 239	. 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ((𝐶 ∈ (𝑀 LinCo 𝑉) ∧ 𝐷 ∈ (𝑀 LinCo 𝑉)) → (𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉)))
73	72	imp 407	1 ⊢ (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐶 ∈ (𝑀 LinCo 𝑉) ∧ 𝐷 ∈ (𝑀 LinCo 𝑉))) → (𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ∃wrex 3065 𝒫 cpw 4533 class class class wbr 5074 ‘cfv 6433 (class class class)co 7275 ∘_f cof 7531 ↑_m cmap 8615 finSupp cfsupp 9128 Basecbs 16912 +_gcplusg 16962 Scalarcsca 16965 0_gc0g 17150 Mndcmnd 18385 LModclmod 20123 linC clinc 45745 LinCo clinco 45746

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-se 5545 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-isom 6442 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-of 7533 df-om 7713 df-1st 7831 df-2nd 7832 df-supp 7978 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-er 8498 df-map 8617 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-fsupp 9129 df-oi 9269 df-card 9697 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-nn 11974 df-2 12036 df-n0 12234 df-z 12320 df-uz 12583 df-fz 13240 df-fzo 13383 df-seq 13722 df-hash 14045 df-sets 16865 df-slot 16883 df-ndx 16895 df-base 16913 df-ress 16942 df-plusg 16975 df-0g 17152 df-gsum 17153 df-mgm 18326 df-sgrp 18375 df-mnd 18386 df-submnd 18431 df-grp 18580 df-minusg 18581 df-cntz 18923 df-cmn 19388 df-abl 19389 df-mgp 19721 df-ur 19738 df-ring 19785 df-lmod 20125 df-linc 45747 df-lco 45748

This theorem is referenced by: lincsumscmcl 45774

W3C validator