Theorem lbsextlem2 21437

Description: Lemma for lbsext 21441. Since 𝐴 is a chain (actually, we only need it to be closed under binary union), the union 𝑇 of the spans of each individual element of 𝐴 is a subspace, and it contains all of ∪ 𝐴 (except for our target vector 𝑥- we are trying to make 𝑥 a linear combination of all the other vectors in some set from 𝐴). (Contributed by Mario Carneiro, 25-Jun-2014.)

Hypotheses

Ref	Expression
lbsext.v	⊢ 𝑉 = (Base‘𝑊)
lbsext.j	⊢ 𝐽 = (LBasis‘𝑊)
lbsext.n	⊢ 𝑁 = (LSpan‘𝑊)
lbsext.w	⊢ (𝜑 → 𝑊 ∈ LVec)
lbsext.c	⊢ (𝜑 → 𝐶 ⊆ 𝑉)
lbsext.x	⊢ (𝜑 → ∀𝑥 ∈ 𝐶 ¬ 𝑥 ∈ (𝑁‘(𝐶 ∖ {𝑥})))
lbsext.s	⊢ 𝑆 = {𝑧 ∈ 𝒫 𝑉 ∣ (𝐶 ⊆ 𝑧 ∧ ∀𝑥 ∈ 𝑧 ¬ 𝑥 ∈ (𝑁‘(𝑧 ∖ {𝑥})))}
lbsext.p	⊢ 𝑃 = (LSubSp‘𝑊)
lbsext.a	⊢ (𝜑 → 𝐴 ⊆ 𝑆)
lbsext.z	⊢ (𝜑 → 𝐴 ≠ ∅)
lbsext.r	⊢ (𝜑 → [⊊] Or 𝐴)
lbsext.t	⊢ 𝑇 = ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥}))

Assertion

Ref	Expression
lbsextlem2	⊢ (𝜑 → (𝑇 ∈ 𝑃 ∧ (∪ 𝐴 ∖ {𝑥}) ⊆ 𝑇))

Distinct variable groups:   𝑥,𝐽   𝑥,𝑢,𝜑   𝑢,𝑆,𝑥   𝑥,𝑧,𝐶   𝑧,𝑢,𝑁,𝑥   𝑢,𝑉,𝑥,𝑧   𝑢,𝑊,𝑥   𝑢,𝐴,𝑥,𝑧

Allowed substitution hints:   𝜑(𝑧)   𝐶(𝑢)   𝑃(𝑥, 𝑧, 𝑢)   𝑆(𝑧)   𝑇(𝑥, 𝑧, 𝑢)   𝐽(𝑧, 𝑢)   𝑊(𝑧)

Proof of Theorem lbsextlem2

Dummy variables 𝑚 𝑛 𝑟 𝑣 𝑤 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqidd 2761	. . 3 ⊢ (𝜑 → (Scalar‘𝑊) = (Scalar‘𝑊))
2		eqidd 2761	. . 3 ⊢ (𝜑 → (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊)))
3		lbsext.v	. . . 4 ⊢ 𝑉 = (Base‘𝑊)
4	3	a1i 11	. . 3 ⊢ (𝜑 → 𝑉 = (Base‘𝑊))
5		eqidd 2761	. . 3 ⊢ (𝜑 → (+g‘𝑊) = (+g‘𝑊))
6		eqidd 2761	. . 3 ⊢ (𝜑 → ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊))
7		lbsext.p	. . . 4 ⊢ 𝑃 = (LSubSp‘𝑊)
8	7	a1i 11	. . 3 ⊢ (𝜑 → 𝑃 = (LSubSp‘𝑊))
9		lbsext.t	. . . 4 ⊢ 𝑇 = ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥}))
10		lbsext.w	. . . . . . . 8 ⊢ (𝜑 → 𝑊 ∈ LVec)
11		lveclmod 21381	. . . . . . . 8 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod)
12	10, 11	syl 18	. . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ LMod)
13		lbsext.a	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ⊆ 𝑆)
14		lbsext.s	. . . . . . . . . . . 12 ⊢ 𝑆 = {𝑧 ∈ 𝒫 𝑉 ∣ (𝐶 ⊆ 𝑧 ∧ ∀𝑥 ∈ 𝑧 ¬ 𝑥 ∈ (𝑁‘(𝑧 ∖ {𝑥})))}
15	14	ssrab3 4007	. . . . . . . . . . 11 ⊢ 𝑆 ⊆ 𝒫 𝑉
16	13, 15	sstrdi 3920	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ⊆ 𝒫 𝑉)
17	16	sselda 3908	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐴) → 𝑢 ∈ 𝒫 𝑉)
18	17	elpwid 4565	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐴) → 𝑢 ⊆ 𝑉)
19	18	ssdifssd 4083	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐴) → (𝑢 ∖ {𝑥}) ⊆ 𝑉)
20		lbsext.n	. . . . . . . 8 ⊢ 𝑁 = (LSpan‘𝑊)
21	3, 20	lspssv 21258	. . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ (𝑢 ∖ {𝑥}) ⊆ 𝑉) → (𝑁‘(𝑢 ∖ {𝑥})) ⊆ 𝑉)
22	12, 19, 21	syl2an2r 698	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐴) → (𝑁‘(𝑢 ∖ {𝑥})) ⊆ 𝑉)
23	22	ralrimiva 3154	. . . . 5 ⊢ (𝜑 → ∀𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ⊆ 𝑉)
24		iunss 5002	. . . . 5 ⊢ (∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ⊆ 𝑉 ↔ ∀𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ⊆ 𝑉)
25	23, 24	sylibr 237	. . . 4 ⊢ (𝜑 → ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ⊆ 𝑉)
26	9, 25	eqsstrid 3946	. . 3 ⊢ (𝜑 → 𝑇 ⊆ 𝑉)
27	9	a1i 11	. . . 4 ⊢ (𝜑 → 𝑇 = ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})))
28		lbsext.z	. . . . . 6 ⊢ (𝜑 → 𝐴 ≠ ∅)
29	3, 7, 20	lspcl 21251	. . . . . . . . 9 ⊢ ((𝑊 ∈ LMod ∧ (𝑢 ∖ {𝑥}) ⊆ 𝑉) → (𝑁‘(𝑢 ∖ {𝑥})) ∈ 𝑃)
30	12, 19, 29	syl2an2r 698	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐴) → (𝑁‘(𝑢 ∖ {𝑥})) ∈ 𝑃)
31	7	lssn0 21215	. . . . . . . 8 ⊢ ((𝑁‘(𝑢 ∖ {𝑥})) ∈ 𝑃 → (𝑁‘(𝑢 ∖ {𝑥})) ≠ ∅)
32	30, 31	syl 18	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐴) → (𝑁‘(𝑢 ∖ {𝑥})) ≠ ∅)
33	32	ralrimiva 3154	. . . . . 6 ⊢ (𝜑 → ∀𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ≠ ∅)
34		r19.2z 4454	. . . . . 6 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ≠ ∅) → ∃𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ≠ ∅)
35	28, 33, 34	syl2anc 596	. . . . 5 ⊢ (𝜑 → ∃𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ≠ ∅)
36		iunn0 5024	. . . . 5 ⊢ (∃𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ≠ ∅ ↔ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ≠ ∅)
37	35, 36	sylib 221	. . . 4 ⊢ (𝜑 → ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ≠ ∅)
38	27, 37	eqnetrd 3022	. . 3 ⊢ (𝜑 → 𝑇 ≠ ∅)
39	9	eleq2i 2852	. . . . . . . . 9 ⊢ (𝑣 ∈ 𝑇 ↔ 𝑣 ∈ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})))
40		eliun 4954	. . . . . . . . 9 ⊢ (𝑣 ∈ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ↔ ∃𝑢 ∈ 𝐴 𝑣 ∈ (𝑁‘(𝑢 ∖ {𝑥})))
41		difeq1 4056	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑚 → (𝑢 ∖ {𝑥}) = (𝑚 ∖ {𝑥}))
42	41	fveq2d 6889	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑚 → (𝑁‘(𝑢 ∖ {𝑥})) = (𝑁‘(𝑚 ∖ {𝑥})))
43	42	eleq2d 2846	. . . . . . . . . 10 ⊢ (𝑢 = 𝑚 → (𝑣 ∈ (𝑁‘(𝑢 ∖ {𝑥})) ↔ 𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥}))))
44	43	cbvrexvw 3241	. . . . . . . . 9 ⊢ (∃𝑢 ∈ 𝐴 𝑣 ∈ (𝑁‘(𝑢 ∖ {𝑥})) ↔ ∃𝑚 ∈ 𝐴 𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})))
45	39, 40, 44	3bitri 300	. . . . . . . 8 ⊢ (𝑣 ∈ 𝑇 ↔ ∃𝑚 ∈ 𝐴 𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})))
46	9	eleq2i 2852	. . . . . . . . 9 ⊢ (𝑤 ∈ 𝑇 ↔ 𝑤 ∈ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})))
47		eliun 4954	. . . . . . . . 9 ⊢ (𝑤 ∈ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ↔ ∃𝑢 ∈ 𝐴 𝑤 ∈ (𝑁‘(𝑢 ∖ {𝑥})))
48		difeq1 4056	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑛 → (𝑢 ∖ {𝑥}) = (𝑛 ∖ {𝑥}))
49	48	fveq2d 6889	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑛 → (𝑁‘(𝑢 ∖ {𝑥})) = (𝑁‘(𝑛 ∖ {𝑥})))
50	49	eleq2d 2846	. . . . . . . . . 10 ⊢ (𝑢 = 𝑛 → (𝑤 ∈ (𝑁‘(𝑢 ∖ {𝑥})) ↔ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥}))))
51	50	cbvrexvw 3241	. . . . . . . . 9 ⊢ (∃𝑢 ∈ 𝐴 𝑤 ∈ (𝑁‘(𝑢 ∖ {𝑥})) ↔ ∃𝑛 ∈ 𝐴 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))
52	46, 47, 51	3bitri 300	. . . . . . . 8 ⊢ (𝑤 ∈ 𝑇 ↔ ∃𝑛 ∈ 𝐴 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))
53	45, 52	anbi12i 640	. . . . . . 7 ⊢ ((𝑣 ∈ 𝑇 ∧ 𝑤 ∈ 𝑇) ↔ (∃𝑚 ∈ 𝐴 𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ ∃𝑛 ∈ 𝐴 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥}))))
54		reeanv 3234	. . . . . . 7 ⊢ (∃𝑚 ∈ 𝐴 ∃𝑛 ∈ 𝐴 (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥}))) ↔ (∃𝑚 ∈ 𝐴 𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ ∃𝑛 ∈ 𝐴 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥}))))
55	53, 54	bitr4i 281	. . . . . 6 ⊢ ((𝑣 ∈ 𝑇 ∧ 𝑤 ∈ 𝑇) ↔ ∃𝑚 ∈ 𝐴 ∃𝑛 ∈ 𝐴 (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥}))))
56		simp1l 1216	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → 𝜑)
57		lbsext.r	. . . . . . . . . . . 12 ⊢ (𝜑 → [⊊] Or 𝐴)
58	56, 57	syl 18	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → [⊊] Or 𝐴)
59		simp2 1155	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴))
60		sorpssun 7746	. . . . . . . . . . 11 ⊢ (( [⊊] Or 𝐴 ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴)) → (𝑚 ∪ 𝑛) ∈ 𝐴)
61	58, 59, 60	syl2anc 596	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → (𝑚 ∪ 𝑛) ∈ 𝐴)
62	56, 12	syl 18	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → 𝑊 ∈ LMod)
63		elssuni 4898	. . . . . . . . . . . . . . 15 ⊢ ((𝑚 ∪ 𝑛) ∈ 𝐴 → (𝑚 ∪ 𝑛) ⊆ ∪ 𝐴)
64	61, 63	syl 18	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → (𝑚 ∪ 𝑛) ⊆ ∪ 𝐴)
65		sspwuni 5059	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ⊆ 𝒫 𝑉 ↔ ∪ 𝐴 ⊆ 𝑉)
66	16, 65	sylib 221	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ∪ 𝐴 ⊆ 𝑉)
67	56, 66	syl 18	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → ∪ 𝐴 ⊆ 𝑉)
68	64, 67	sstrd 3918	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → (𝑚 ∪ 𝑛) ⊆ 𝑉)
69	68	ssdifssd 4083	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → ((𝑚 ∪ 𝑛) ∖ {𝑥}) ⊆ 𝑉)
70	3, 7, 20	lspcl 21251	. . . . . . . . . . . 12 ⊢ ((𝑊 ∈ LMod ∧ ((𝑚 ∪ 𝑛) ∖ {𝑥}) ⊆ 𝑉) → (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})) ∈ 𝑃)
71	62, 69, 70	syl2anc 596	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})) ∈ 𝑃)
72		simp1r 1217	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → 𝑟 ∈ (Base‘(Scalar‘𝑊)))
73		ssun1 4176	. . . . . . . . . . . . . 14 ⊢ 𝑚 ⊆ (𝑚 ∪ 𝑛)
74		ssdif 4080	. . . . . . . . . . . . . 14 ⊢ (𝑚 ⊆ (𝑚 ∪ 𝑛) → (𝑚 ∖ {𝑥}) ⊆ ((𝑚 ∪ 𝑛) ∖ {𝑥}))
75	73, 74	mp1i 14	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → (𝑚 ∖ {𝑥}) ⊆ ((𝑚 ∪ 𝑛) ∖ {𝑥}))
76	3, 20	lspss 21259	. . . . . . . . . . . . 13 ⊢ ((𝑊 ∈ LMod ∧ ((𝑚 ∪ 𝑛) ∖ {𝑥}) ⊆ 𝑉 ∧ (𝑚 ∖ {𝑥}) ⊆ ((𝑚 ∪ 𝑛) ∖ {𝑥})) → (𝑁‘(𝑚 ∖ {𝑥})) ⊆ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})))
77	62, 69, 75, 76	syl3anc 1398	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → (𝑁‘(𝑚 ∖ {𝑥})) ⊆ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})))
78		simp3l 1220	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → 𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})))
79	77, 78	sseldd 3909	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → 𝑣 ∈ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})))
80		ssun2 4177	. . . . . . . . . . . . . 14 ⊢ 𝑛 ⊆ (𝑚 ∪ 𝑛)
81		ssdif 4080	. . . . . . . . . . . . . 14 ⊢ (𝑛 ⊆ (𝑚 ∪ 𝑛) → (𝑛 ∖ {𝑥}) ⊆ ((𝑚 ∪ 𝑛) ∖ {𝑥}))
82	80, 81	mp1i 14	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → (𝑛 ∖ {𝑥}) ⊆ ((𝑚 ∪ 𝑛) ∖ {𝑥}))
83	3, 20	lspss 21259	. . . . . . . . . . . . 13 ⊢ ((𝑊 ∈ LMod ∧ ((𝑚 ∪ 𝑛) ∖ {𝑥}) ⊆ 𝑉 ∧ (𝑛 ∖ {𝑥}) ⊆ ((𝑚 ∪ 𝑛) ∖ {𝑥})) → (𝑁‘(𝑛 ∖ {𝑥})) ⊆ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})))
84	62, 69, 82, 83	syl3anc 1398	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → (𝑁‘(𝑛 ∖ {𝑥})) ⊆ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})))
85		simp3r 1221	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))
86	84, 85	sseldd 3909	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → 𝑤 ∈ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})))
87		eqid 2760	. . . . . . . . . . . 12 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊)
88		eqid 2760	. . . . . . . . . . . 12 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
89		eqid 2760	. . . . . . . . . . . 12 ⊢ (+g‘𝑊) = (+g‘𝑊)
90		eqid 2760	. . . . . . . . . . . 12 ⊢ ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊)
91	87, 88, 89, 90, 7	lsscl 21217	. . . . . . . . . . 11 ⊢ (((𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})) ∈ 𝑃 ∧ (𝑟 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑣 ∈ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})))) → ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})))
92	71, 72, 79, 86, 91	syl13anc 1399	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})))
93		difeq1 4056	. . . . . . . . . . . 12 ⊢ (𝑢 = (𝑚 ∪ 𝑛) → (𝑢 ∖ {𝑥}) = ((𝑚 ∪ 𝑛) ∖ {𝑥}))
94	93	fveq2d 6889	. . . . . . . . . . 11 ⊢ (𝑢 = (𝑚 ∪ 𝑛) → (𝑁‘(𝑢 ∖ {𝑥})) = (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})))
95	94	eliuni 4956	. . . . . . . . . 10 ⊢ (((𝑚 ∪ 𝑛) ∈ 𝐴 ∧ ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥}))) → ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})))
96	61, 92, 95	syl2anc 596	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})))
97	96, 9	eleqtrrdi 2871	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ 𝑇)
98	97	3expia 1139	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴)) → ((𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥}))) → ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ 𝑇))
99	98	rexlimdvva 3219	. . . . . 6 ⊢ ((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) → (∃𝑚 ∈ 𝐴 ∃𝑛 ∈ 𝐴 (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥}))) → ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ 𝑇))
100	55, 99	biimtrid 245	. . . . 5 ⊢ ((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) → ((𝑣 ∈ 𝑇 ∧ 𝑤 ∈ 𝑇) → ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ 𝑇))
101	100	exp4b 436	. . . 4 ⊢ (𝜑 → (𝑟 ∈ (Base‘(Scalar‘𝑊)) → (𝑣 ∈ 𝑇 → (𝑤 ∈ 𝑇 → ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ 𝑇))))
102	101	3imp2 1368	. . 3 ⊢ ((𝜑 ∧ (𝑟 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑣 ∈ 𝑇 ∧ 𝑤 ∈ 𝑇)) → ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ 𝑇)
103	1, 2, 4, 5, 6, 8, 26, 38, 102	islssd 21210	. 2 ⊢ (𝜑 → 𝑇 ∈ 𝑃)
104		eldifi 4067	. . . . . . 7 ⊢ (𝑦 ∈ (∪ 𝐴 ∖ {𝑥}) → 𝑦 ∈ ∪ 𝐴)
105	104	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (∪ 𝐴 ∖ {𝑥})) → 𝑦 ∈ ∪ 𝐴)
106		eldifn 4068	. . . . . . . . . 10 ⊢ (𝑦 ∈ (∪ 𝐴 ∖ {𝑥}) → ¬ 𝑦 ∈ {𝑥})
107	106	ad2antlr 740	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ (∪ 𝐴 ∖ {𝑥})) ∧ 𝑢 ∈ 𝐴) → ¬ 𝑦 ∈ {𝑥})
108		eldif 4049	. . . . . . . . . 10 ⊢ (𝑦 ∈ (𝑢 ∖ {𝑥}) ↔ (𝑦 ∈ 𝑢 ∧ ¬ 𝑦 ∈ {𝑥}))
109	3, 20	lspssid 21260	. . . . . . . . . . . . 13 ⊢ ((𝑊 ∈ LMod ∧ (𝑢 ∖ {𝑥}) ⊆ 𝑉) → (𝑢 ∖ {𝑥}) ⊆ (𝑁‘(𝑢 ∖ {𝑥})))
110	12, 19, 109	syl2an2r 698	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐴) → (𝑢 ∖ {𝑥}) ⊆ (𝑁‘(𝑢 ∖ {𝑥})))
111	110	adantlr 728	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ (∪ 𝐴 ∖ {𝑥})) ∧ 𝑢 ∈ 𝐴) → (𝑢 ∖ {𝑥}) ⊆ (𝑁‘(𝑢 ∖ {𝑥})))
112	111	sseld 3907	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ (∪ 𝐴 ∖ {𝑥})) ∧ 𝑢 ∈ 𝐴) → (𝑦 ∈ (𝑢 ∖ {𝑥}) → 𝑦 ∈ (𝑁‘(𝑢 ∖ {𝑥}))))
113	108, 112	biimtrrid 246	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ (∪ 𝐴 ∖ {𝑥})) ∧ 𝑢 ∈ 𝐴) → ((𝑦 ∈ 𝑢 ∧ ¬ 𝑦 ∈ {𝑥}) → 𝑦 ∈ (𝑁‘(𝑢 ∖ {𝑥}))))
114	107, 113	mpan2d 707	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ (∪ 𝐴 ∖ {𝑥})) ∧ 𝑢 ∈ 𝐴) → (𝑦 ∈ 𝑢 → 𝑦 ∈ (𝑁‘(𝑢 ∖ {𝑥}))))
115	114	reximdva 3175	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (∪ 𝐴 ∖ {𝑥})) → (∃𝑢 ∈ 𝐴 𝑦 ∈ 𝑢 → ∃𝑢 ∈ 𝐴 𝑦 ∈ (𝑁‘(𝑢 ∖ {𝑥}))))
116		eluni2 4870	. . . . . . 7 ⊢ (𝑦 ∈ ∪ 𝐴 ↔ ∃𝑢 ∈ 𝐴 𝑦 ∈ 𝑢)
117		eliun 4954	. . . . . . 7 ⊢ (𝑦 ∈ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ↔ ∃𝑢 ∈ 𝐴 𝑦 ∈ (𝑁‘(𝑢 ∖ {𝑥})))
118	115, 116, 117	3imtr4g 299	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (∪ 𝐴 ∖ {𝑥})) → (𝑦 ∈ ∪ 𝐴 → 𝑦 ∈ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥}))))
119	105, 118	mpd 16	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (∪ 𝐴 ∖ {𝑥})) → 𝑦 ∈ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})))
120	119	ex 418	. . . 4 ⊢ (𝜑 → (𝑦 ∈ (∪ 𝐴 ∖ {𝑥}) → 𝑦 ∈ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥}))))
121	120	ssrdv 3914	. . 3 ⊢ (𝜑 → (∪ 𝐴 ∖ {𝑥}) ⊆ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})))
122	121, 9	sseqtrrdi 3949	. 2 ⊢ (𝜑 → (∪ 𝐴 ∖ {𝑥}) ⊆ 𝑇)
123	103, 122	jca 521	1 ⊢ (𝜑 → (𝑇 ∈ 𝑃 ∧ (∪ 𝐴 ∖ {𝑥}) ⊆ 𝑇))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∀wral 3076  ∃wrex 3086  {crab 3412   ⊆ wss 3895   ∖ cdif 4045   ∪ cun 4149  ∅c0 4278  𝒫 cpw 4556  {csn 4583  ∪ cuni 4866  ∪ ciun 4950   Or wor 5557  ‘cfv 6538  (class class class)co 7420   [⊊] crpss 7738  Basecbs 17387  +_gcplusg 17428  Scalarcsca 17431   ·_𝑠 cvsca 17432  LModclmod 21135  LSubSpclss 21206  LSpanclspn 21246  LBasisclbs 21349  LVecclvec 21377

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-cnex 11256  ax-resscn 11257  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-addrcl 11261  ax-mulcl 11262  ax-mulrcl 11263  ax-mulcom 11264  ax-addass 11265  ax-mulass 11266  ax-distr 11267  ax-i2m1 11268  ax-1ne0 11269  ax-1rid 11270  ax-rnegex 11271  ax-rrecex 11272  ax-cnre 11273  ax-pre-lttri 11274  ax-pre-lttrn 11275  ax-pre-ltadd 11276  ax-pre-mulgt0 11277

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-rpss 7739  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-er 8717  df-en 8974  df-dom 8975  df-sdom 8976  df-pnf 11345  df-mnf 11346  df-xr 11347  df-ltxr 11348  df-le 11349  df-sub 11543  df-neg 11544  df-nn 12336  df-2 12405  df-sets 17342  df-slot 17360  df-ndx 17372  df-base 17388  df-plusg 17441  df-0g 17612  df-mgm 18816  df-sgrp 18908  df-mnd 18924  df-grp 19147  df-minusg 19148  df-sbg 19149  df-mgp 20361  df-ur 20408  df-ring 20461  df-lmod 21137  df-lss 21207  df-lsp 21247  df-lvec 21378

This theorem is used by:  lbsextlem3  21438