Theorem lbsextlem2 21131

Description: Lemma for lbsext 21135. 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 2738	. . 3 ⊢ (𝜑 → (Scalar‘𝑊) = (Scalar‘𝑊))
2		eqidd 2738	. . 3 ⊢ (𝜑 → (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊)))
3		lbsext.v	. . . 4 ⊢ 𝑉 = (Base‘𝑊)
4	3	a1i 11	. . 3 ⊢ (𝜑 → 𝑉 = (Base‘𝑊))
5		eqidd 2738	. . 3 ⊢ (𝜑 → (+g‘𝑊) = (+g‘𝑊))
6		eqidd 2738	. . 3 ⊢ (𝜑 → ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊))
7		lbsext.p	. . . 4 ⊢ 𝑃 = (LSubSp‘𝑊)
8	7	a1i 11	. . 3 ⊢ (𝜑 → 𝑃 = (LSubSp‘𝑊))
9		lbsext.t	. . . 4 ⊢ 𝑇 = ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥}))
10		lbsext.w	. . . . . . . 8 ⊢ (𝜑 → 𝑊 ∈ LVec)
11		lveclmod 21075	. . . . . . . 8 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod)
12	10, 11	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ LMod)
13		lbsext.a	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ⊆ 𝑆)
14		lbsext.s	. . . . . . . . . . . 12 ⊢ 𝑆 = {𝑧 ∈ 𝒫 𝑉 ∣ (𝐶 ⊆ 𝑧 ∧ ∀𝑥 ∈ 𝑧 ¬ 𝑥 ∈ (𝑁‘(𝑧 ∖ {𝑥})))}
15	14	ssrab3 4036	. . . . . . . . . . 11 ⊢ 𝑆 ⊆ 𝒫 𝑉
16	13, 15	sstrdi 3948	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ⊆ 𝒫 𝑉)
17	16	sselda 3935	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐴) → 𝑢 ∈ 𝒫 𝑉)
18	17	elpwid 4565	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐴) → 𝑢 ⊆ 𝑉)
19	18	ssdifssd 4101	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐴) → (𝑢 ∖ {𝑥}) ⊆ 𝑉)
20		lbsext.n	. . . . . . . 8 ⊢ 𝑁 = (LSpan‘𝑊)
21	3, 20	lspssv 20951	. . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ (𝑢 ∖ {𝑥}) ⊆ 𝑉) → (𝑁‘(𝑢 ∖ {𝑥})) ⊆ 𝑉)
22	12, 19, 21	syl2an2r 686	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐴) → (𝑁‘(𝑢 ∖ {𝑥})) ⊆ 𝑉)
23	22	ralrimiva 3130	. . . . 5 ⊢ (𝜑 → ∀𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ⊆ 𝑉)
24		iunss 5002	. . . . 5 ⊢ (∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ⊆ 𝑉 ↔ ∀𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ⊆ 𝑉)
25	23, 24	sylibr 234	. . . 4 ⊢ (𝜑 → ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ⊆ 𝑉)
26	9, 25	eqsstrid 3974	. . 3 ⊢ (𝜑 → 𝑇 ⊆ 𝑉)
27	9	a1i 11	. . . 4 ⊢ (𝜑 → 𝑇 = ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})))
28		lbsext.z	. . . . . 6 ⊢ (𝜑 → 𝐴 ≠ ∅)
29	3, 7, 20	lspcl 20944	. . . . . . . . 9 ⊢ ((𝑊 ∈ LMod ∧ (𝑢 ∖ {𝑥}) ⊆ 𝑉) → (𝑁‘(𝑢 ∖ {𝑥})) ∈ 𝑃)
30	12, 19, 29	syl2an2r 686	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐴) → (𝑁‘(𝑢 ∖ {𝑥})) ∈ 𝑃)
31	7	lssn0 20908	. . . . . . . 8 ⊢ ((𝑁‘(𝑢 ∖ {𝑥})) ∈ 𝑃 → (𝑁‘(𝑢 ∖ {𝑥})) ≠ ∅)
32	30, 31	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐴) → (𝑁‘(𝑢 ∖ {𝑥})) ≠ ∅)
33	32	ralrimiva 3130	. . . . . 6 ⊢ (𝜑 → ∀𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ≠ ∅)
34		r19.2z 4454	. . . . . 6 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ≠ ∅) → ∃𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ≠ ∅)
35	28, 33, 34	syl2anc 585	. . . . 5 ⊢ (𝜑 → ∃𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ≠ ∅)
36		iunn0 5024	. . . . 5 ⊢ (∃𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ≠ ∅ ↔ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ≠ ∅)
37	35, 36	sylib 218	. . . 4 ⊢ (𝜑 → ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ≠ ∅)
38	27, 37	eqnetrd 3000	. . 3 ⊢ (𝜑 → 𝑇 ≠ ∅)
39	9	eleq2i 2829	. . . . . . . . 9 ⊢ (𝑣 ∈ 𝑇 ↔ 𝑣 ∈ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})))
40		eliun 4952	. . . . . . . . 9 ⊢ (𝑣 ∈ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ↔ ∃𝑢 ∈ 𝐴 𝑣 ∈ (𝑁‘(𝑢 ∖ {𝑥})))
41		difeq1 4073	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑚 → (𝑢 ∖ {𝑥}) = (𝑚 ∖ {𝑥}))
42	41	fveq2d 6848	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑚 → (𝑁‘(𝑢 ∖ {𝑥})) = (𝑁‘(𝑚 ∖ {𝑥})))
43	42	eleq2d 2823	. . . . . . . . . 10 ⊢ (𝑢 = 𝑚 → (𝑣 ∈ (𝑁‘(𝑢 ∖ {𝑥})) ↔ 𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥}))))
44	43	cbvrexvw 3217	. . . . . . . . 9 ⊢ (∃𝑢 ∈ 𝐴 𝑣 ∈ (𝑁‘(𝑢 ∖ {𝑥})) ↔ ∃𝑚 ∈ 𝐴 𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})))
45	39, 40, 44	3bitri 297	. . . . . . . 8 ⊢ (𝑣 ∈ 𝑇 ↔ ∃𝑚 ∈ 𝐴 𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})))
46	9	eleq2i 2829	. . . . . . . . 9 ⊢ (𝑤 ∈ 𝑇 ↔ 𝑤 ∈ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})))
47		eliun 4952	. . . . . . . . 9 ⊢ (𝑤 ∈ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ↔ ∃𝑢 ∈ 𝐴 𝑤 ∈ (𝑁‘(𝑢 ∖ {𝑥})))
48		difeq1 4073	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑛 → (𝑢 ∖ {𝑥}) = (𝑛 ∖ {𝑥}))
49	48	fveq2d 6848	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑛 → (𝑁‘(𝑢 ∖ {𝑥})) = (𝑁‘(𝑛 ∖ {𝑥})))
50	49	eleq2d 2823	. . . . . . . . . 10 ⊢ (𝑢 = 𝑛 → (𝑤 ∈ (𝑁‘(𝑢 ∖ {𝑥})) ↔ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥}))))
51	50	cbvrexvw 3217	. . . . . . . . 9 ⊢ (∃𝑢 ∈ 𝐴 𝑤 ∈ (𝑁‘(𝑢 ∖ {𝑥})) ↔ ∃𝑛 ∈ 𝐴 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))
52	46, 47, 51	3bitri 297	. . . . . . . 8 ⊢ (𝑤 ∈ 𝑇 ↔ ∃𝑛 ∈ 𝐴 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))
53	45, 52	anbi12i 629	. . . . . . 7 ⊢ ((𝑣 ∈ 𝑇 ∧ 𝑤 ∈ 𝑇) ↔ (∃𝑚 ∈ 𝐴 𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ ∃𝑛 ∈ 𝐴 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥}))))
54		reeanv 3210	. . . . . . 7 ⊢ (∃𝑚 ∈ 𝐴 ∃𝑛 ∈ 𝐴 (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥}))) ↔ (∃𝑚 ∈ 𝐴 𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ ∃𝑛 ∈ 𝐴 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥}))))
55	53, 54	bitr4i 278	. . . . . 6 ⊢ ((𝑣 ∈ 𝑇 ∧ 𝑤 ∈ 𝑇) ↔ ∃𝑚 ∈ 𝐴 ∃𝑛 ∈ 𝐴 (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥}))))
56		simp1l 1199	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → 𝜑)
57		lbsext.r	. . . . . . . . . . . 12 ⊢ (𝜑 → [⊊] Or 𝐴)
58	56, 57	syl 17	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → [⊊] Or 𝐴)
59		simp2 1138	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴))
60		sorpssun 7687	. . . . . . . . . . 11 ⊢ (( [⊊] Or 𝐴 ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴)) → (𝑚 ∪ 𝑛) ∈ 𝐴)
61	58, 59, 60	syl2anc 585	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → (𝑚 ∪ 𝑛) ∈ 𝐴)
62	56, 12	syl 17	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → 𝑊 ∈ LMod)
63		elssuni 4896	. . . . . . . . . . . . . . 15 ⊢ ((𝑚 ∪ 𝑛) ∈ 𝐴 → (𝑚 ∪ 𝑛) ⊆ ∪ 𝐴)
64	61, 63	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → (𝑚 ∪ 𝑛) ⊆ ∪ 𝐴)
65		sspwuni 5057	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ⊆ 𝒫 𝑉 ↔ ∪ 𝐴 ⊆ 𝑉)
66	16, 65	sylib 218	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ∪ 𝐴 ⊆ 𝑉)
67	56, 66	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → ∪ 𝐴 ⊆ 𝑉)
68	64, 67	sstrd 3946	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → (𝑚 ∪ 𝑛) ⊆ 𝑉)
69	68	ssdifssd 4101	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → ((𝑚 ∪ 𝑛) ∖ {𝑥}) ⊆ 𝑉)
70	3, 7, 20	lspcl 20944	. . . . . . . . . . . 12 ⊢ ((𝑊 ∈ LMod ∧ ((𝑚 ∪ 𝑛) ∖ {𝑥}) ⊆ 𝑉) → (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})) ∈ 𝑃)
71	62, 69, 70	syl2anc 585	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})) ∈ 𝑃)
72		simp1r 1200	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → 𝑟 ∈ (Base‘(Scalar‘𝑊)))
73		ssun1 4132	. . . . . . . . . . . . . 14 ⊢ 𝑚 ⊆ (𝑚 ∪ 𝑛)
74		ssdif 4098	. . . . . . . . . . . . . 14 ⊢ (𝑚 ⊆ (𝑚 ∪ 𝑛) → (𝑚 ∖ {𝑥}) ⊆ ((𝑚 ∪ 𝑛) ∖ {𝑥}))
75	73, 74	mp1i 13	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → (𝑚 ∖ {𝑥}) ⊆ ((𝑚 ∪ 𝑛) ∖ {𝑥}))
76	3, 20	lspss 20952	. . . . . . . . . . . . 13 ⊢ ((𝑊 ∈ LMod ∧ ((𝑚 ∪ 𝑛) ∖ {𝑥}) ⊆ 𝑉 ∧ (𝑚 ∖ {𝑥}) ⊆ ((𝑚 ∪ 𝑛) ∖ {𝑥})) → (𝑁‘(𝑚 ∖ {𝑥})) ⊆ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})))
77	62, 69, 75, 76	syl3anc 1374	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → (𝑁‘(𝑚 ∖ {𝑥})) ⊆ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})))
78		simp3l 1203	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → 𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})))
79	77, 78	sseldd 3936	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → 𝑣 ∈ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})))
80		ssun2 4133	. . . . . . . . . . . . . 14 ⊢ 𝑛 ⊆ (𝑚 ∪ 𝑛)
81		ssdif 4098	. . . . . . . . . . . . . 14 ⊢ (𝑛 ⊆ (𝑚 ∪ 𝑛) → (𝑛 ∖ {𝑥}) ⊆ ((𝑚 ∪ 𝑛) ∖ {𝑥}))
82	80, 81	mp1i 13	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → (𝑛 ∖ {𝑥}) ⊆ ((𝑚 ∪ 𝑛) ∖ {𝑥}))
83	3, 20	lspss 20952	. . . . . . . . . . . . 13 ⊢ ((𝑊 ∈ LMod ∧ ((𝑚 ∪ 𝑛) ∖ {𝑥}) ⊆ 𝑉 ∧ (𝑛 ∖ {𝑥}) ⊆ ((𝑚 ∪ 𝑛) ∖ {𝑥})) → (𝑁‘(𝑛 ∖ {𝑥})) ⊆ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})))
84	62, 69, 82, 83	syl3anc 1374	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → (𝑁‘(𝑛 ∖ {𝑥})) ⊆ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})))
85		simp3r 1204	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))
86	84, 85	sseldd 3936	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → 𝑤 ∈ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})))
87		eqid 2737	. . . . . . . . . . . 12 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊)
88		eqid 2737	. . . . . . . . . . . 12 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
89		eqid 2737	. . . . . . . . . . . 12 ⊢ (+g‘𝑊) = (+g‘𝑊)
90		eqid 2737	. . . . . . . . . . . 12 ⊢ ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊)
91	87, 88, 89, 90, 7	lsscl 20910	. . . . . . . . . . 11 ⊢ (((𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})) ∈ 𝑃 ∧ (𝑟 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑣 ∈ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})))) → ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})))
92	71, 72, 79, 86, 91	syl13anc 1375	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})))
93		difeq1 4073	. . . . . . . . . . . 12 ⊢ (𝑢 = (𝑚 ∪ 𝑛) → (𝑢 ∖ {𝑥}) = ((𝑚 ∪ 𝑛) ∖ {𝑥}))
94	93	fveq2d 6848	. . . . . . . . . . 11 ⊢ (𝑢 = (𝑚 ∪ 𝑛) → (𝑁‘(𝑢 ∖ {𝑥})) = (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥})))
95	94	eliuni 4954	. . . . . . . . . 10 ⊢ (((𝑚 ∪ 𝑛) ∈ 𝐴 ∧ ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ (𝑁‘((𝑚 ∪ 𝑛) ∖ {𝑥}))) → ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})))
96	61, 92, 95	syl2anc 585	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})))
97	96, 9	eleqtrrdi 2848	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴) ∧ (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥})))) → ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ 𝑇)
98	97	3expia 1122	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) ∧ (𝑚 ∈ 𝐴 ∧ 𝑛 ∈ 𝐴)) → ((𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥}))) → ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ 𝑇))
99	98	rexlimdvva 3195	. . . . . 6 ⊢ ((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) → (∃𝑚 ∈ 𝐴 ∃𝑛 ∈ 𝐴 (𝑣 ∈ (𝑁‘(𝑚 ∖ {𝑥})) ∧ 𝑤 ∈ (𝑁‘(𝑛 ∖ {𝑥}))) → ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ 𝑇))
100	55, 99	biimtrid 242	. . . . 5 ⊢ ((𝜑 ∧ 𝑟 ∈ (Base‘(Scalar‘𝑊))) → ((𝑣 ∈ 𝑇 ∧ 𝑤 ∈ 𝑇) → ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ 𝑇))
101	100	exp4b 430	. . . 4 ⊢ (𝜑 → (𝑟 ∈ (Base‘(Scalar‘𝑊)) → (𝑣 ∈ 𝑇 → (𝑤 ∈ 𝑇 → ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ 𝑇))))
102	101	3imp2 1351	. . 3 ⊢ ((𝜑 ∧ (𝑟 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑣 ∈ 𝑇 ∧ 𝑤 ∈ 𝑇)) → ((𝑟( ·𝑠 ‘𝑊)𝑣)(+g‘𝑊)𝑤) ∈ 𝑇)
103	1, 2, 4, 5, 6, 8, 26, 38, 102	islssd 20903	. 2 ⊢ (𝜑 → 𝑇 ∈ 𝑃)
104		eldifi 4085	. . . . . . 7 ⊢ (𝑦 ∈ (∪ 𝐴 ∖ {𝑥}) → 𝑦 ∈ ∪ 𝐴)
105	104	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (∪ 𝐴 ∖ {𝑥})) → 𝑦 ∈ ∪ 𝐴)
106		eldifn 4086	. . . . . . . . . 10 ⊢ (𝑦 ∈ (∪ 𝐴 ∖ {𝑥}) → ¬ 𝑦 ∈ {𝑥})
107	106	ad2antlr 728	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ (∪ 𝐴 ∖ {𝑥})) ∧ 𝑢 ∈ 𝐴) → ¬ 𝑦 ∈ {𝑥})
108		eldif 3913	. . . . . . . . . 10 ⊢ (𝑦 ∈ (𝑢 ∖ {𝑥}) ↔ (𝑦 ∈ 𝑢 ∧ ¬ 𝑦 ∈ {𝑥}))
109	3, 20	lspssid 20953	. . . . . . . . . . . . 13 ⊢ ((𝑊 ∈ LMod ∧ (𝑢 ∖ {𝑥}) ⊆ 𝑉) → (𝑢 ∖ {𝑥}) ⊆ (𝑁‘(𝑢 ∖ {𝑥})))
110	12, 19, 109	syl2an2r 686	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐴) → (𝑢 ∖ {𝑥}) ⊆ (𝑁‘(𝑢 ∖ {𝑥})))
111	110	adantlr 716	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ (∪ 𝐴 ∖ {𝑥})) ∧ 𝑢 ∈ 𝐴) → (𝑢 ∖ {𝑥}) ⊆ (𝑁‘(𝑢 ∖ {𝑥})))
112	111	sseld 3934	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ (∪ 𝐴 ∖ {𝑥})) ∧ 𝑢 ∈ 𝐴) → (𝑦 ∈ (𝑢 ∖ {𝑥}) → 𝑦 ∈ (𝑁‘(𝑢 ∖ {𝑥}))))
113	108, 112	biimtrrid 243	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ (∪ 𝐴 ∖ {𝑥})) ∧ 𝑢 ∈ 𝐴) → ((𝑦 ∈ 𝑢 ∧ ¬ 𝑦 ∈ {𝑥}) → 𝑦 ∈ (𝑁‘(𝑢 ∖ {𝑥}))))
114	107, 113	mpan2d 695	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ (∪ 𝐴 ∖ {𝑥})) ∧ 𝑢 ∈ 𝐴) → (𝑦 ∈ 𝑢 → 𝑦 ∈ (𝑁‘(𝑢 ∖ {𝑥}))))
115	114	reximdva 3151	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (∪ 𝐴 ∖ {𝑥})) → (∃𝑢 ∈ 𝐴 𝑦 ∈ 𝑢 → ∃𝑢 ∈ 𝐴 𝑦 ∈ (𝑁‘(𝑢 ∖ {𝑥}))))
116		eluni2 4869	. . . . . . 7 ⊢ (𝑦 ∈ ∪ 𝐴 ↔ ∃𝑢 ∈ 𝐴 𝑦 ∈ 𝑢)
117		eliun 4952	. . . . . . 7 ⊢ (𝑦 ∈ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})) ↔ ∃𝑢 ∈ 𝐴 𝑦 ∈ (𝑁‘(𝑢 ∖ {𝑥})))
118	115, 116, 117	3imtr4g 296	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (∪ 𝐴 ∖ {𝑥})) → (𝑦 ∈ ∪ 𝐴 → 𝑦 ∈ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥}))))
119	105, 118	mpd 15	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (∪ 𝐴 ∖ {𝑥})) → 𝑦 ∈ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})))
120	119	ex 412	. . . 4 ⊢ (𝜑 → (𝑦 ∈ (∪ 𝐴 ∖ {𝑥}) → 𝑦 ∈ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥}))))
121	120	ssrdv 3941	. . 3 ⊢ (𝜑 → (∪ 𝐴 ∖ {𝑥}) ⊆ ∪ 𝑢 ∈ 𝐴 (𝑁‘(𝑢 ∖ {𝑥})))
122	121, 9	sseqtrrdi 3977	. 2 ⊢ (𝜑 → (∪ 𝐴 ∖ {𝑥}) ⊆ 𝑇)
123	103, 122	jca 511	1 ⊢ (𝜑 → (𝑇 ∈ 𝑃 ∧ (∪ 𝐴 ∖ {𝑥}) ⊆ 𝑇))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  ∃wrex 3062  {crab 3401   ∖ cdif 3900   ∪ cun 3901   ⊆ wss 3903  ∅c0 4287  𝒫 cpw 4556  {csn 4582  ∪ cuni 4865  ∪ ciun 4948   Or wor 5541  ‘cfv 6502  (class class class)co 7370   [⊊] crpss 7679  Basecbs 17150  +_gcplusg 17191  Scalarcsca 17194   ·_𝑠 cvsca 17195  LModclmod 20828  LSubSpclss 20899  LSpanclspn 20939  LBasisclbs 21043  LVecclvec 21071

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 2709  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5314  ax-pr 5381  ax-un 7692  ax-cnex 11096  ax-resscn 11097  ax-1cn 11098  ax-icn 11099  ax-addcl 11100  ax-addrcl 11101  ax-mulcl 11102  ax-mulrcl 11103  ax-mulcom 11104  ax-addass 11105  ax-mulass 11106  ax-distr 11107  ax-i2m1 11108  ax-1ne0 11109  ax-1rid 11110  ax-rnegex 11111  ax-rrecex 11112  ax-cnre 11113  ax-pre-lttri 11114  ax-pre-lttrn 11115  ax-pre-ltadd 11116  ax-pre-mulgt0 11117

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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5529  df-eprel 5534  df-po 5542  df-so 5543  df-fr 5587  df-we 5589  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-pred 6269  df-ord 6330  df-on 6331  df-lim 6332  df-suc 6333  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-f1 6507  df-fo 6508  df-f1o 6509  df-fv 6510  df-riota 7327  df-ov 7373  df-oprab 7374  df-mpo 7375  df-rpss 7680  df-om 7821  df-1st 7945  df-2nd 7946  df-frecs 8235  df-wrecs 8266  df-recs 8315  df-rdg 8353  df-er 8647  df-en 8898  df-dom 8899  df-sdom 8900  df-pnf 11182  df-mnf 11183  df-xr 11184  df-ltxr 11185  df-le 11186  df-sub 11380  df-neg 11381  df-nn 12160  df-2 12222  df-sets 17105  df-slot 17123  df-ndx 17135  df-base 17151  df-plusg 17204  df-0g 17375  df-mgm 18579  df-sgrp 18658  df-mnd 18674  df-grp 18883  df-minusg 18884  df-sbg 18885  df-mgp 20093  df-ur 20134  df-ring 20187  df-lmod 20830  df-lss 20900  df-lsp 20940  df-lvec 21072

This theorem is referenced by:  lbsextlem3  21132