Users' Mathboxes 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 48907
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.
StepHypRef Expression
1 eqid 2736 . . . . 5 (Base‘𝑀) = (Base‘𝑀)
2 eqid 2736 . . . . 5 (Scalar‘𝑀) = (Scalar‘𝑀)
3 eqid 2736 . . . . 5 (Base‘(Scalar‘𝑀)) = (Base‘(Scalar‘𝑀))
41, 2, 3lcoval 48888 . . . 4 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (𝐶 ∈ (𝑀 LinCo 𝑉) ↔ (𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉)))))
51, 2, 3lcoval 48888 . . . 4 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (𝐷 ∈ (𝑀 LinCo 𝑉) ↔ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))))
64, 5anbi12d 633 . . 3 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ((𝐶 ∈ (𝑀 LinCo 𝑉) ∧ 𝐷 ∈ (𝑀 LinCo 𝑉)) ↔ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))))
7 simpll 767 . . . . . 6 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → 𝑀 ∈ LMod)
8 simpll 767 . . . . . . 7 (((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → 𝐶 ∈ (Base‘𝑀))
98adantl 481 . . . . . 6 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → 𝐶 ∈ (Base‘𝑀))
10 simprl 771 . . . . . . 7 (((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → 𝐷 ∈ (Base‘𝑀))
1110adantl 481 . . . . . 6 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → 𝐷 ∈ (Base‘𝑀))
12 lincsumcl.b . . . . . . 7 + = (+g𝑀)
131, 12lmodvacl 20870 . . . . . 6 ((𝑀 ∈ LMod ∧ 𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀)) → (𝐶 + 𝐷) ∈ (Base‘𝑀))
147, 9, 11, 13syl3anc 1374 . . . . 5 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → (𝐶 + 𝐷) ∈ (Base‘𝑀))
152lmodfgrp 20864 . . . . . . . . . . . . . . . . . . 19 (𝑀 ∈ LMod → (Scalar‘𝑀) ∈ Grp)
1615grpmndd 18922 . . . . . . . . . . . . . . . . . 18 (𝑀 ∈ LMod → (Scalar‘𝑀) ∈ Mnd)
1716adantr 480 . . . . . . . . . . . . . . . . 17 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (Scalar‘𝑀) ∈ Mnd)
1817adantl 481 . . . . . . . . . . . . . . . 16 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (Scalar‘𝑀) ∈ Mnd)
19 simpr 484 . . . . . . . . . . . . . . . . 17 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → 𝑉 ∈ 𝒫 (Base‘𝑀))
2019adantl 481 . . . . . . . . . . . . . . . 16 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → 𝑉 ∈ 𝒫 (Base‘𝑀))
21 simpll 767 . . . . . . . . . . . . . . . . . 18 (((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) → 𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉))
22 simpl 482 . . . . . . . . . . . . . . . . . 18 ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉))
2321, 22anim12i 614 . . . . . . . . . . . . . . . . 17 ((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → (𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)))
2423adantr 480 . . . . . . . . . . . . . . . 16 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)))
25 eqid 2736 . . . . . . . . . . . . . . . . 17 (+g‘(Scalar‘𝑀)) = (+g‘(Scalar‘𝑀))
263, 25ofaddmndmap 48819 . . . . . . . . . . . . . . . 16 (((Scalar‘𝑀) ∈ Mnd ∧ 𝑉 ∈ 𝒫 (Base‘𝑀) ∧ (𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉))) → (𝑦f (+g‘(Scalar‘𝑀))𝑥) ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉))
2718, 20, 24, 26syl3anc 1374 . . . . . . . . . . . . . . 15 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (𝑦f (+g‘(Scalar‘𝑀))𝑥) ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉))
2816anim1i 616 . . . . . . . . . . . . . . . . 17 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ((Scalar‘𝑀) ∈ Mnd ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)))
2928adantl 481 . . . . . . . . . . . . . . . 16 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → ((Scalar‘𝑀) ∈ Mnd ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)))
30 simprl 771 . . . . . . . . . . . . . . . . . . 19 ((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → 𝑦 finSupp (0g‘(Scalar‘𝑀)))
3130adantr 480 . . . . . . . . . . . . . . . . . 18 (((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) → 𝑦 finSupp (0g‘(Scalar‘𝑀)))
32 simprl 771 . . . . . . . . . . . . . . . . . 18 ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → 𝑥 finSupp (0g‘(Scalar‘𝑀)))
3331, 32anim12i 614 . . . . . . . . . . . . . . . . 17 ((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝑥 finSupp (0g‘(Scalar‘𝑀))))
3433adantr 480 . . . . . . . . . . . . . . . 16 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝑥 finSupp (0g‘(Scalar‘𝑀))))
353mndpfsupp 18735 . . . . . . . . . . . . . . . 16 ((((Scalar‘𝑀) ∈ Mnd ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝑥 finSupp (0g‘(Scalar‘𝑀)))) → (𝑦f (+g‘(Scalar‘𝑀))𝑥) finSupp (0g‘(Scalar‘𝑀)))
3629, 24, 34, 35syl3anc 1374 . . . . . . . . . . . . . . 15 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (𝑦f (+g‘(Scalar‘𝑀))𝑥) finSupp (0g‘(Scalar‘𝑀)))
37 oveq12 7376 . . . . . . . . . . . . . . . . . . . . . . . . 25 ((𝐶 = (𝑦( linC ‘𝑀)𝑉) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉)))
3837expcom 413 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝐷 = (𝑥( linC ‘𝑀)𝑉) → (𝐶 = (𝑦( linC ‘𝑀)𝑉) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
3938adantl 481 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)) → (𝐶 = (𝑦( linC ‘𝑀)𝑉) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
4039adantl 481 . . . . . . . . . . . . . . . . . . . . . 22 ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 = (𝑦( linC ‘𝑀)𝑉) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
4140com12 32 . . . . . . . . . . . . . . . . . . . . 21 (𝐶 = (𝑦( linC ‘𝑀)𝑉) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
4241adantl 481 . . . . . . . . . . . . . . . . . . . 20 ((𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉)) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
4342adantl 481 . . . . . . . . . . . . . . . . . . 19 ((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
4443adantr 480 . . . . . . . . . . . . . . . . . 18 (((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
4544imp 406 . . . . . . . . . . . . . . . . 17 ((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉)))
4645adantr 480 . . . . . . . . . . . . . . . 16 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉)))
47 simpr 484 . . . . . . . . . . . . . . . . 17 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)))
48 eqid 2736 . . . . . . . . . . . . . . . . . 18 (𝑦( linC ‘𝑀)𝑉) = (𝑦( linC ‘𝑀)𝑉)
49 eqid 2736 . . . . . . . . . . . . . . . . . 18 (𝑥( linC ‘𝑀)𝑉) = (𝑥( linC ‘𝑀)𝑉)
5012, 48, 49, 2, 3, 25lincsum 48905 . . . . . . . . . . . . . . . . 17 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝑥 finSupp (0g‘(Scalar‘𝑀)))) → ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉)) = ((𝑦f (+g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉))
5147, 24, 34, 50syl3anc 1374 . . . . . . . . . . . . . . . 16 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉)) = ((𝑦f (+g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉))
5246, 51eqtrd 2771 . . . . . . . . . . . . . . 15 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (𝐶 + 𝐷) = ((𝑦f (+g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉))
53 breq1 5088 . . . . . . . . . . . . . . . . 17 (𝑠 = (𝑦f (+g‘(Scalar‘𝑀))𝑥) → (𝑠 finSupp (0g‘(Scalar‘𝑀)) ↔ (𝑦f (+g‘(Scalar‘𝑀))𝑥) finSupp (0g‘(Scalar‘𝑀))))
54 oveq1 7374 . . . . . . . . . . . . . . . . . 18 (𝑠 = (𝑦f (+g‘(Scalar‘𝑀))𝑥) → (𝑠( linC ‘𝑀)𝑉) = ((𝑦f (+g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉))
5554eqeq2d 2747 . . . . . . . . . . . . . . . . 17 (𝑠 = (𝑦f (+g‘(Scalar‘𝑀))𝑥) → ((𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉) ↔ (𝐶 + 𝐷) = ((𝑦f (+g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉)))
5653, 55anbi12d 633 . . . . . . . . . . . . . . . 16 (𝑠 = (𝑦f (+g‘(Scalar‘𝑀))𝑥) → ((𝑠 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)) ↔ ((𝑦f (+g‘(Scalar‘𝑀))𝑥) finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = ((𝑦f (+g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉))))
5756rspcev 3564 . . . . . . . . . . . . . . 15 (((𝑦f (+g‘(Scalar‘𝑀))𝑥) ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ ((𝑦f (+g‘(Scalar‘𝑀))𝑥) finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = ((𝑦f (+g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉))) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑠 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)))
5827, 36, 52, 57syl12anc 837 . . . . . . . . . . . . . 14 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑠 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)))
5958exp41 434 . . . . . . . . . . . . 13 ((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → ((𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀)) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑠 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉))))))
6059rexlimiva 3130 . . . . . . . . . . . 12 (∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉)) → ((𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀)) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑠 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉))))))
6160expd 415 . . . . . . . . . . 11 (∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉)) → (𝐶 ∈ (Base‘𝑀) → (𝐷 ∈ (Base‘𝑀) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑠 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)))))))
6261impcom 407 . . . . . . . . . 10 ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → (𝐷 ∈ (Base‘𝑀) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑠 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉))))))
6362com13 88 . . . . . . . . 9 ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐷 ∈ (Base‘𝑀) → ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑠 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉))))))
6463rexlimiva 3130 . . . . . . . 8 (∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)) → (𝐷 ∈ (Base‘𝑀) → ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑠 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉))))))
6564impcom 407 . . . . . . 7 ((𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑠 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)))))
6665impcom 407 . . . . . 6 (((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑠 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉))))
6766impcom 407 . . . . 5 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑠 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)))
681, 2, 3lcoval 48888 . . . . . 6 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ((𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉) ↔ ((𝐶 + 𝐷) ∈ (Base‘𝑀) ∧ ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑠 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)))))
6968adantr 480 . . . . 5 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → ((𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉) ↔ ((𝐶 + 𝐷) ∈ (Base‘𝑀) ∧ ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑠 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)))))
7014, 67, 69mpbir2and 714 . . . 4 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → (𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉))
7170ex 412 . . 3 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → (𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉)))
726, 71sylbid 240 . 2 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ((𝐶 ∈ (𝑀 LinCo 𝑉) ∧ 𝐷 ∈ (𝑀 LinCo 𝑉)) → (𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉)))
7372imp 406 1 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐶 ∈ (𝑀 LinCo 𝑉) ∧ 𝐷 ∈ (𝑀 LinCo 𝑉))) → (𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wrex 3061  𝒫 cpw 4541   class class class wbr 5085  cfv 6498  (class class class)co 7367  f cof 7629  m cmap 8773   finSupp cfsupp 9274  Basecbs 17179  +gcplusg 17220  Scalarcsca 17223  0gc0g 17402  Mndcmnd 18702  LModclmod 20855   linC clinc 48880   LinCo clinco 48881
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-se 5585  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-isom 6507  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-of 7631  df-om 7818  df-1st 7942  df-2nd 7943  df-supp 8111  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-er 8643  df-map 8775  df-en 8894  df-dom 8895  df-sdom 8896  df-fin 8897  df-fsupp 9275  df-oi 9425  df-card 9863  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-nn 12175  df-2 12244  df-n0 12438  df-z 12525  df-uz 12789  df-fz 13462  df-fzo 13609  df-seq 13964  df-hash 14293  df-sets 17134  df-slot 17152  df-ndx 17164  df-base 17180  df-ress 17201  df-plusg 17233  df-0g 17404  df-gsum 17405  df-mgm 18608  df-sgrp 18687  df-mnd 18703  df-submnd 18752  df-grp 18912  df-minusg 18913  df-cntz 19292  df-cmn 19757  df-abl 19758  df-mgp 20122  df-ur 20163  df-ring 20216  df-lmod 20857  df-linc 48882  df-lco 48883
This theorem is referenced by:  lincsumscmcl  48909
  Copyright terms: Public domain W3C validator