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 49095
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 2769 . . . . 5 (Base‘𝑀) = (Base‘𝑀)
2 eqid 2769 . . . . 5 (Scalar‘𝑀) = (Scalar‘𝑀)
3 eqid 2769 . . . . 5 (Base‘(Scalar‘𝑀)) = (Base‘(Scalar‘𝑀))
41, 2, 3lcoval 49076 . . . 4 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (𝐶 ∈ (𝑀 LinCo 𝑉) ↔ (𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉)))))
51, 2, 3lcoval 49076 . . . 4 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (𝐷 ∈ (𝑀 LinCo 𝑉) ↔ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))))
64, 5anbi12d 643 . . 3 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ((𝐶 ∈ (𝑀 LinCo 𝑉) ∧ 𝐷 ∈ (𝑀 LinCo 𝑉)) ↔ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))))
7 simpll 778 . . . . . 6 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → 𝑀 ∈ LMod)
8 simpll 778 . . . . . . 7 (((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → 𝐶 ∈ (Base‘𝑀))
98adantl 486 . . . . . 6 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → 𝐶 ∈ (Base‘𝑀))
10 simprl 782 . . . . . . 7 (((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → 𝐷 ∈ (Base‘𝑀))
1110adantl 486 . . . . . 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 20973 . . . . . 6 ((𝑀 ∈ LMod ∧ 𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀)) → (𝐶 + 𝐷) ∈ (Base‘𝑀))
147, 9, 11, 13syl3anc 1396 . . . . 5 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → (𝐶 + 𝐷) ∈ (Base‘𝑀))
152lmodfgrp 20967 . . . . . . . . . . . . . . . . . . 19 (𝑀 ∈ LMod → (Scalar‘𝑀) ∈ Grp)
1615grpmndd 19012 . . . . . . . . . . . . . . . . . 18 (𝑀 ∈ LMod → (Scalar‘𝑀) ∈ Mnd)
1716adantr 485 . . . . . . . . . . . . . . . . 17 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (Scalar‘𝑀) ∈ Mnd)
1817adantl 486 . . . . . . . . . . . . . . . 16 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (Scalar‘𝑀) ∈ Mnd)
19 simpr 489 . . . . . . . . . . . . . . . . 17 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → 𝑉 ∈ 𝒫 (Base‘𝑀))
2019adantl 486 . . . . . . . . . . . . . . . 16 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → 𝑉 ∈ 𝒫 (Base‘𝑀))
21 simpll 778 . . . . . . . . . . . . . . . . . 18 (((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) → 𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉))
22 simpl 487 . . . . . . . . . . . . . . . . . 18 ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉))
2321, 22anim12i 624 . . . . . . . . . . . . . . . . 17 ((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → (𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)))
2423adantr 485 . . . . . . . . . . . . . . . 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 2769 . . . . . . . . . . . . . . . . 17 (+g‘(Scalar‘𝑀)) = (+g‘(Scalar‘𝑀))
263, 25ofaddmndmap 49007 . . . . . . . . . . . . . . . 16 (((Scalar‘𝑀) ∈ Mnd ∧ 𝑉 ∈ 𝒫 (Base‘𝑀) ∧ (𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉))) → (𝑦f (+g‘(Scalar‘𝑀))𝑥) ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉))
2718, 20, 24, 26syl3anc 1396 . . . . . . . . . . . . . . 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 626 . . . . . . . . . . . . . . . . 17 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ((Scalar‘𝑀) ∈ Mnd ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)))
2928adantl 486 . . . . . . . . . . . . . . . 16 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → ((Scalar‘𝑀) ∈ Mnd ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)))
30 simprl 782 . . . . . . . . . . . . . . . . . . 19 ((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → 𝑦 finSupp (0g‘(Scalar‘𝑀)))
3130adantr 485 . . . . . . . . . . . . . . . . . 18 (((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) → 𝑦 finSupp (0g‘(Scalar‘𝑀)))
32 simprl 782 . . . . . . . . . . . . . . . . . 18 ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → 𝑥 finSupp (0g‘(Scalar‘𝑀)))
3331, 32anim12i 624 . . . . . . . . . . . . . . . . 17 ((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝑥 finSupp (0g‘(Scalar‘𝑀))))
3433adantr 485 . . . . . . . . . . . . . . . 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 18824 . . . . . . . . . . . . . . . 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 1396 . . . . . . . . . . . . . . 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 7420 . . . . . . . . . . . . . . . . . . . . . . . . 25 ((𝐶 = (𝑦( linC ‘𝑀)𝑉) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉)))
3837expcom 418 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝐷 = (𝑥( linC ‘𝑀)𝑉) → (𝐶 = (𝑦( linC ‘𝑀)𝑉) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
3938adantl 486 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)) → (𝐶 = (𝑦( linC ‘𝑀)𝑉) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
4039adantl 486 . . . . . . . . . . . . . . . . . . . . . 22 ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 = (𝑦( linC ‘𝑀)𝑉) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
4140com12 33 . . . . . . . . . . . . . . . . . . . . 21 (𝐶 = (𝑦( linC ‘𝑀)𝑉) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
4241adantl 486 . . . . . . . . . . . . . . . . . . . 20 ((𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉)) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
4342adantl 486 . . . . . . . . . . . . . . . . . . 19 ((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
4443adantr 485 . . . . . . . . . . . . . . . . . 18 (((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
4544imp 411 . . . . . . . . . . . . . . . . 17 ((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉)))
4645adantr 485 . . . . . . . . . . . . . . . 16 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉)))
47 simpr 489 . . . . . . . . . . . . . . . . 17 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)))
48 eqid 2769 . . . . . . . . . . . . . . . . . 18 (𝑦( linC ‘𝑀)𝑉) = (𝑦( linC ‘𝑀)𝑉)
49 eqid 2769 . . . . . . . . . . . . . . . . . 18 (𝑥( linC ‘𝑀)𝑉) = (𝑥( linC ‘𝑀)𝑉)
5012, 48, 49, 2, 3, 25lincsum 49093 . . . . . . . . . . . . . . . . 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 1396 . . . . . . . . . . . . . . . 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 2804 . . . . . . . . . . . . . . 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 5116 . . . . . . . . . . . . . . . . 17 (𝑠 = (𝑦f (+g‘(Scalar‘𝑀))𝑥) → (𝑠 finSupp (0g‘(Scalar‘𝑀)) ↔ (𝑦f (+g‘(Scalar‘𝑀))𝑥) finSupp (0g‘(Scalar‘𝑀))))
54 oveq1 7418 . . . . . . . . . . . . . . . . . 18 (𝑠 = (𝑦f (+g‘(Scalar‘𝑀))𝑥) → (𝑠( linC ‘𝑀)𝑉) = ((𝑦f (+g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉))
5554eqeq2d 2780 . . . . . . . . . . . . . . . . 17 (𝑠 = (𝑦f (+g‘(Scalar‘𝑀))𝑥) → ((𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉) ↔ (𝐶 + 𝐷) = ((𝑦f (+g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉)))
5653, 55anbi12d 643 . . . . . . . . . . . . . . . 16 (𝑠 = (𝑦f (+g‘(Scalar‘𝑀))𝑥) → ((𝑠 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)) ↔ ((𝑦f (+g‘(Scalar‘𝑀))𝑥) finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = ((𝑦f (+g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉))))
5756rspcev 3590 . . . . . . . . . . . . . . 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 849 . . . . . . . . . . . . . 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 439 . . . . . . . . . . . . 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 3164 . . . . . . . . . . . 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 420 . . . . . . . . . . 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 412 . . . . . . . . . 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 89 . . . . . . . . 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 3164 . . . . . . . 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 412 . . . . . . 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 412 . . . . . 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 412 . . . . 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 49076 . . . . . 6 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ((𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉) ↔ ((𝐶 + 𝐷) ∈ (Base‘𝑀) ∧ ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑠 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)))))
6968adantr 485 . . . . 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 725 . . . 4 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → (𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉))
7170ex 417 . . 3 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → (𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉)))
726, 71sylbid 243 . 2 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ((𝐶 ∈ (𝑀 LinCo 𝑉) ∧ 𝐷 ∈ (𝑀 LinCo 𝑉)) → (𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉)))
7372imp 411 1 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐶 ∈ (𝑀 LinCo 𝑉) ∧ 𝐷 ∈ (𝑀 LinCo 𝑉))) → (𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1567  wcel 2149  wrex 3095  𝒫 cpw 4567   class class class wbr 5113  cfv 6537  (class class class)co 7411  f cof 7673  m cmap 8823   finSupp cfsupp 9320  Basecbs 17268  +gcplusg 17309  Scalarcsca 17312  0gc0g 17491  Mndcmnd 18791  LModclmod 20958   linC clinc 49068   LinCo clinco 49069
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733  ax-cnex 11155  ax-resscn 11156  ax-1cn 11157  ax-icn 11158  ax-addcl 11159  ax-addrcl 11160  ax-mulcl 11161  ax-mulrcl 11162  ax-mulcom 11163  ax-addass 11164  ax-mulass 11165  ax-distr 11166  ax-i2m1 11167  ax-1ne0 11168  ax-1rid 11169  ax-rnegex 11170  ax-rrecex 11171  ax-cnre 11172  ax-pre-lttri 11173  ax-pre-lttrn 11174  ax-pre-ltadd 11175  ax-pre-mulgt0 11176
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-int 4917  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-se 5616  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-isom 6546  df-riota 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-of 7675  df-om 7862  df-1st 7985  df-2nd 7986  df-supp 8156  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-rdg 8396  df-1o 8452  df-er 8693  df-map 8825  df-en 8943  df-dom 8944  df-sdom 8945  df-fin 8946  df-fsupp 9321  df-oi 9471  df-card 9924  df-pnf 11244  df-mnf 11245  df-xr 11246  df-ltxr 11247  df-le 11248  df-sub 11442  df-neg 11443  df-nn 12233  df-2 12302  df-n0 12504  df-z 12591  df-uz 12862  df-fz 13535  df-fzo 13682  df-seq 14037  df-hash 14366  df-sets 17223  df-slot 17241  df-ndx 17253  df-base 17269  df-ress 17290  df-plusg 17322  df-0g 17493  df-gsum 17494  df-mgm 18697  df-sgrp 18776  df-mnd 18792  df-submnd 18841  df-grp 19002  df-minusg 19003  df-cntz 19386  df-cmn 19851  df-abl 19852  df-mgp 20216  df-ur 20263  df-ring 20316  df-lmod 20960  df-linc 49070  df-lco 49071
This theorem is referenced by:  lincsumscmcl  49097
  Copyright terms: Public domain W3C validator