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 49244
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 2766 . . . . 5 (Base‘𝑀) = (Base‘𝑀)
2 eqid 2766 . . . . 5 (Scalar‘𝑀) = (Scalar‘𝑀)
3 eqid 2766 . . . . 5 (Base‘(Scalar‘𝑀)) = (Base‘(Scalar‘𝑀))
41, 2, 3lcoval 49225 . . . 4 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (𝐶 ∈ (𝑀 LinCo 𝑉) ↔ (𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉)))))
51, 2, 3lcoval 49225 . . . 4 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (𝐷 ∈ (𝑀 LinCo 𝑉) ↔ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))))
64, 5anbi12d 644 . . 3 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ((𝐶 ∈ (𝑀 LinCo 𝑉) ∧ 𝐷 ∈ (𝑀 LinCo 𝑉)) ↔ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))))
7 simpll 779 . . . . . 6 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → 𝑀 ∈ LMod)
8 simpll 779 . . . . . . 7 (((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → 𝐶 ∈ (Base‘𝑀))
98adantl 487 . . . . . 6 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → 𝐶 ∈ (Base‘𝑀))
10 simprl 783 . . . . . . 7 (((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → 𝐷 ∈ (Base‘𝑀))
1110adantl 487 . . . . . 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 21026 . . . . . 6 ((𝑀 ∈ LMod ∧ 𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀)) → (𝐶 + 𝐷) ∈ (Base‘𝑀))
147, 9, 11, 13syl3anc 1398 . . . . 5 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → (𝐶 + 𝐷) ∈ (Base‘𝑀))
152lmodfgrp 21020 . . . . . . . . . . . . . . . . . . 19 (𝑀 ∈ LMod → (Scalar‘𝑀) ∈ Grp)
1615grpmndd 19038 . . . . . . . . . . . . . . . . . 18 (𝑀 ∈ LMod → (Scalar‘𝑀) ∈ Mnd)
1716adantr 486 . . . . . . . . . . . . . . . . 17 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (Scalar‘𝑀) ∈ Mnd)
1817adantl 487 . . . . . . . . . . . . . . . 16 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (Scalar‘𝑀) ∈ Mnd)
19 simpr 490 . . . . . . . . . . . . . . . . 17 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → 𝑉 ∈ 𝒫 (Base‘𝑀))
2019adantl 487 . . . . . . . . . . . . . . . 16 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → 𝑉 ∈ 𝒫 (Base‘𝑀))
21 simpll 779 . . . . . . . . . . . . . . . . . 18 (((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) → 𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉))
22 simpl 488 . . . . . . . . . . . . . . . . . 18 ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉))
2321, 22anim12i 625 . . . . . . . . . . . . . . . . 17 ((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → (𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)))
2423adantr 486 . . . . . . . . . . . . . . . 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 2766 . . . . . . . . . . . . . . . . 17 (+g‘(Scalar‘𝑀)) = (+g‘(Scalar‘𝑀))
263, 25ofaddmndmap 49156 . . . . . . . . . . . . . . . 16 (((Scalar‘𝑀) ∈ Mnd ∧ 𝑉 ∈ 𝒫 (Base‘𝑀) ∧ (𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉))) → (𝑦f (+g‘(Scalar‘𝑀))𝑥) ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉))
2718, 20, 24, 26syl3anc 1398 . . . . . . . . . . . . . . 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 627 . . . . . . . . . . . . . . . . 17 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ((Scalar‘𝑀) ∈ Mnd ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)))
2928adantl 487 . . . . . . . . . . . . . . . 16 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → ((Scalar‘𝑀) ∈ Mnd ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)))
30 simprl 783 . . . . . . . . . . . . . . . . . . 19 ((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → 𝑦 finSupp (0g‘(Scalar‘𝑀)))
3130adantr 486 . . . . . . . . . . . . . . . . . 18 (((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) → 𝑦 finSupp (0g‘(Scalar‘𝑀)))
32 simprl 783 . . . . . . . . . . . . . . . . . 18 ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → 𝑥 finSupp (0g‘(Scalar‘𝑀)))
3331, 32anim12i 625 . . . . . . . . . . . . . . . . 17 ((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝑥 finSupp (0g‘(Scalar‘𝑀))))
3433adantr 486 . . . . . . . . . . . . . . . 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 18850 . . . . . . . . . . . . . . . 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 1398 . . . . . . . . . . . . . . 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 7432 . . . . . . . . . . . . . . . . . . . . . . . . 25 ((𝐶 = (𝑦( linC ‘𝑀)𝑉) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉)))
3837expcom 419 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝐷 = (𝑥( linC ‘𝑀)𝑉) → (𝐶 = (𝑦( linC ‘𝑀)𝑉) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
3938adantl 487 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)) → (𝐶 = (𝑦( linC ‘𝑀)𝑉) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
4039adantl 487 . . . . . . . . . . . . . . . . . . . . . 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 487 . . . . . . . . . . . . . . . . . . . 20 ((𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉)) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
4342adantl 487 . . . . . . . . . . . . . . . . . . 19 ((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
4443adantr 486 . . . . . . . . . . . . . . . . . 18 (((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) → ((𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉))))
4544imp 412 . . . . . . . . . . . . . . . . 17 ((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉)))
4645adantr 486 . . . . . . . . . . . . . . . 16 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (𝐶 + 𝐷) = ((𝑦( linC ‘𝑀)𝑉) + (𝑥( linC ‘𝑀)𝑉)))
47 simpr 490 . . . . . . . . . . . . . . . . 17 (((((𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐶 ∈ (Base‘𝑀) ∧ 𝐷 ∈ (Base‘𝑀))) ∧ (𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ (𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉)))) ∧ (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀))) → (𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)))
48 eqid 2766 . . . . . . . . . . . . . . . . . 18 (𝑦( linC ‘𝑀)𝑉) = (𝑦( linC ‘𝑀)𝑉)
49 eqid 2766 . . . . . . . . . . . . . . . . . 18 (𝑥( linC ‘𝑀)𝑉) = (𝑥( linC ‘𝑀)𝑉)
5012, 48, 49, 2, 3, 25lincsum 49242 . . . . . . . . . . . . . . . . 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 1398 . . . . . . . . . . . . . . . 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 2801 . . . . . . . . . . . . . . 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 5117 . . . . . . . . . . . . . . . . 17 (𝑠 = (𝑦f (+g‘(Scalar‘𝑀))𝑥) → (𝑠 finSupp (0g‘(Scalar‘𝑀)) ↔ (𝑦f (+g‘(Scalar‘𝑀))𝑥) finSupp (0g‘(Scalar‘𝑀))))
54 oveq1 7430 . . . . . . . . . . . . . . . . . 18 (𝑠 = (𝑦f (+g‘(Scalar‘𝑀))𝑥) → (𝑠( linC ‘𝑀)𝑉) = ((𝑦f (+g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉))
5554eqeq2d 2777 . . . . . . . . . . . . . . . . 17 (𝑠 = (𝑦f (+g‘(Scalar‘𝑀))𝑥) → ((𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉) ↔ (𝐶 + 𝐷) = ((𝑦f (+g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉)))
5653, 55anbi12d 644 . . . . . . . . . . . . . . . 16 (𝑠 = (𝑦f (+g‘(Scalar‘𝑀))𝑥) → ((𝑠 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)) ↔ ((𝑦f (+g‘(Scalar‘𝑀))𝑥) finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = ((𝑦f (+g‘(Scalar‘𝑀))𝑥)( linC ‘𝑀)𝑉))))
5756rspcev 3584 . . . . . . . . . . . . . . 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 850 . . . . . . . . . . . . . 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 440 . . . . . . . . . . . . 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 3161 . . . . . . . . . . . 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 421 . . . . . . . . . . 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 413 . . . . . . . . . 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 3161 . . . . . . . 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 413 . . . . . . 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 413 . . . . . 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 413 . . . . 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 49225 . . . . . 6 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → ((𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉) ↔ ((𝐶 + 𝐷) ∈ (Base‘𝑀) ∧ ∃𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑠 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝐶 + 𝐷) = (𝑠( linC ‘𝑀)𝑉)))))
6968adantr 486 . . . . 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 726 . . . 4 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ ((𝐶 ∈ (Base‘𝑀) ∧ ∃𝑦 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑦 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐶 = (𝑦( linC ‘𝑀)𝑉))) ∧ (𝐷 ∈ (Base‘𝑀) ∧ ∃𝑥 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉)(𝑥 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝐷 = (𝑥( linC ‘𝑀)𝑉))))) → (𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉))
7170ex 418 . . 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 412 1 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) ∧ (𝐶 ∈ (𝑀 LinCo 𝑉) ∧ 𝐷 ∈ (𝑀 LinCo 𝑉))) → (𝐶 + 𝐷) ∈ (𝑀 LinCo 𝑉))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2146  wrex 3092  𝒫 cpw 4567   class class class wbr 5114  cfv 6543  (class class class)co 7423  f cof 7685  m cmap 8833   finSupp cfsupp 9331  Basecbs 17294  +gcplusg 17335  Scalarcsca 17338  0gc0g 17517  Mndcmnd 18817  LModclmod 21011   linC clinc 49217   LinCo clinco 49218
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745  ax-cnex 11174  ax-resscn 11175  ax-1cn 11176  ax-icn 11177  ax-addcl 11178  ax-addrcl 11179  ax-mulcl 11180  ax-mulrcl 11181  ax-mulcom 11182  ax-addass 11183  ax-mulass 11184  ax-distr 11185  ax-i2m1 11186  ax-1ne0 11187  ax-1rid 11188  ax-rnegex 11189  ax-rrecex 11190  ax-cnre 11191  ax-pre-lttri 11192  ax-pre-lttrn 11193  ax-pre-ltadd 11194  ax-pre-mulgt0 11195
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-nel 3068  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-int 4918  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-se 5620  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-ord 6370  df-on 6371  df-lim 6372  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-isom 6552  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-of 7687  df-om 7872  df-1st 7995  df-2nd 7996  df-supp 8166  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-rdg 8406  df-1o 8462  df-er 8703  df-map 8835  df-en 8953  df-dom 8954  df-sdom 8955  df-fin 8956  df-fsupp 9332  df-oi 9482  df-card 9944  df-pnf 11263  df-mnf 11264  df-xr 11265  df-ltxr 11266  df-le 11267  df-sub 11461  df-neg 11462  df-nn 12252  df-2 12321  df-n0 12523  df-z 12610  df-uz 12881  df-fz 13554  df-fzo 13702  df-seq 14058  df-hash 14387  df-sets 17249  df-slot 17267  df-ndx 17279  df-base 17295  df-ress 17316  df-plusg 17348  df-0g 17519  df-gsum 17520  df-mgm 18723  df-sgrp 18802  df-mnd 18818  df-submnd 18867  df-grp 19028  df-minusg 19029  df-cntz 19412  df-cmn 19877  df-abl 19878  df-mgp 20242  df-ur 20289  df-ring 20342  df-lmod 21013  df-linc 49219  df-lco 49220
This theorem is used by:  lincsumscmcl  49246
  Copyright terms: Public domain W3C validator