Theorem lclkrlem2r

Description: Lemma for lclkr . When B is zero, i.e. when X and Y are colinear, the intersection of the kernels of E and G equal the kernel of G , so the kernels of G and the sum are comparable. (Contributed by NM, 18-Jan-2015)

	Ref	Expression
Hypotheses	lclkrlem2m.v	⊢ 𝑉 = ( Base ‘ 𝑈 )
	lclkrlem2m.t	⊢ · = ( ·𝑠 ‘ 𝑈 )
	lclkrlem2m.s	⊢ 𝑆 = ( Scalar ‘ 𝑈 )
	lclkrlem2m.q	⊢ × = ( .r ‘ 𝑆 )
	lclkrlem2m.z	⊢ 0 = ( 0g ‘ 𝑆 )
	lclkrlem2m.i	⊢ 𝐼 = ( invr ‘ 𝑆 )
	lclkrlem2m.m	⊢ − = ( -g ‘ 𝑈 )
	lclkrlem2m.f	⊢ 𝐹 = ( LFnl ‘ 𝑈 )
	lclkrlem2m.d	⊢ 𝐷 = ( LDual ‘ 𝑈 )
	lclkrlem2m.p	⊢ + = ( +g ‘ 𝐷 )
	lclkrlem2m.x	⊢ ( 𝜑 → 𝑋 ∈ 𝑉 )
	lclkrlem2m.y	⊢ ( 𝜑 → 𝑌 ∈ 𝑉 )
	lclkrlem2m.e	⊢ ( 𝜑 → 𝐸 ∈ 𝐹 )
	lclkrlem2m.g	⊢ ( 𝜑 → 𝐺 ∈ 𝐹 )
	lclkrlem2n.n	⊢ 𝑁 = ( LSpan ‘ 𝑈 )
	lclkrlem2n.l	⊢ 𝐿 = ( LKer ‘ 𝑈 )
	lclkrlem2o.h	⊢ 𝐻 = ( LHyp ‘ 𝐾 )
	lclkrlem2o.o	⊢ ⊥ = ( ( ocH ‘ 𝐾 ) ‘ 𝑊 )
	lclkrlem2o.u	⊢ 𝑈 = ( ( DVecH ‘ 𝐾 ) ‘ 𝑊 )
	lclkrlem2o.a	⊢ ⊕ = ( LSSum ‘ 𝑈 )
	lclkrlem2o.k	⊢ ( 𝜑 → ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) )
	lclkrlem2q.le	⊢ ( 𝜑 → ( 𝐿 ‘ 𝐸 ) = ( ⊥ ‘ { 𝑋 } ) )
	lclkrlem2q.lg	⊢ ( 𝜑 → ( 𝐿 ‘ 𝐺 ) = ( ⊥ ‘ { 𝑌 } ) )
	lclkrlem2q.b	⊢ 𝐵 = ( 𝑋 − ( ( ( ( 𝐸 + 𝐺 ) ‘ 𝑋 ) × ( 𝐼 ‘ ( ( 𝐸 + 𝐺 ) ‘ 𝑌 ) ) ) · 𝑌 ) )
	lclkrlem2q.n	⊢ ( 𝜑 → ( ( 𝐸 + 𝐺 ) ‘ 𝑌 ) ≠ 0 )
	lclkrlem2r.bn	⊢ ( 𝜑 → 𝐵 = ( 0g ‘ 𝑈 ) )
Assertion	lclkrlem2r	⊢ ( 𝜑 → ( 𝐿 ‘ 𝐺 ) ⊆ ( 𝐿 ‘ ( 𝐸 + 𝐺 ) ) )

Proof

Step	Hyp	Ref	Expression
1		lclkrlem2m.v	⊢ 𝑉 = ( Base ‘ 𝑈 )
2		lclkrlem2m.t	⊢ · = ( ·𝑠 ‘ 𝑈 )
3		lclkrlem2m.s	⊢ 𝑆 = ( Scalar ‘ 𝑈 )
4		lclkrlem2m.q	⊢ × = ( .r ‘ 𝑆 )
5		lclkrlem2m.z	⊢ 0 = ( 0g ‘ 𝑆 )
6		lclkrlem2m.i	⊢ 𝐼 = ( invr ‘ 𝑆 )
7		lclkrlem2m.m	⊢ − = ( -g ‘ 𝑈 )
8		lclkrlem2m.f	⊢ 𝐹 = ( LFnl ‘ 𝑈 )
9		lclkrlem2m.d	⊢ 𝐷 = ( LDual ‘ 𝑈 )
10		lclkrlem2m.p	⊢ + = ( +g ‘ 𝐷 )
11		lclkrlem2m.x	⊢ ( 𝜑 → 𝑋 ∈ 𝑉 )
12		lclkrlem2m.y	⊢ ( 𝜑 → 𝑌 ∈ 𝑉 )
13		lclkrlem2m.e	⊢ ( 𝜑 → 𝐸 ∈ 𝐹 )
14		lclkrlem2m.g	⊢ ( 𝜑 → 𝐺 ∈ 𝐹 )
15		lclkrlem2n.n	⊢ 𝑁 = ( LSpan ‘ 𝑈 )
16		lclkrlem2n.l	⊢ 𝐿 = ( LKer ‘ 𝑈 )
17		lclkrlem2o.h	⊢ 𝐻 = ( LHyp ‘ 𝐾 )
18		lclkrlem2o.o	⊢ ⊥ = ( ( ocH ‘ 𝐾 ) ‘ 𝑊 )
19		lclkrlem2o.u	⊢ 𝑈 = ( ( DVecH ‘ 𝐾 ) ‘ 𝑊 )
20		lclkrlem2o.a	⊢ ⊕ = ( LSSum ‘ 𝑈 )
21		lclkrlem2o.k	⊢ ( 𝜑 → ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) )
22		lclkrlem2q.le	⊢ ( 𝜑 → ( 𝐿 ‘ 𝐸 ) = ( ⊥ ‘ { 𝑋 } ) )
23		lclkrlem2q.lg	⊢ ( 𝜑 → ( 𝐿 ‘ 𝐺 ) = ( ⊥ ‘ { 𝑌 } ) )
24		lclkrlem2q.b	⊢ 𝐵 = ( 𝑋 − ( ( ( ( 𝐸 + 𝐺 ) ‘ 𝑋 ) × ( 𝐼 ‘ ( ( 𝐸 + 𝐺 ) ‘ 𝑌 ) ) ) · 𝑌 ) )
25		lclkrlem2q.n	⊢ ( 𝜑 → ( ( 𝐸 + 𝐺 ) ‘ 𝑌 ) ≠ 0 )
26		lclkrlem2r.bn	⊢ ( 𝜑 → 𝐵 = ( 0g ‘ 𝑈 ) )
27	1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 24 25 26	lclkrlem2p	⊢ ( 𝜑 → ( ⊥ ‘ { 𝑌 } ) ⊆ ( ⊥ ‘ { 𝑋 } ) )
28	27 23 22	3sstr4d	⊢ ( 𝜑 → ( 𝐿 ‘ 𝐺 ) ⊆ ( 𝐿 ‘ 𝐸 ) )
29		sseqin2	⊢ ( ( 𝐿 ‘ 𝐺 ) ⊆ ( 𝐿 ‘ 𝐸 ) ↔ ( ( 𝐿 ‘ 𝐸 ) ∩ ( 𝐿 ‘ 𝐺 ) ) = ( 𝐿 ‘ 𝐺 ) )
30	28 29	sylib	⊢ ( 𝜑 → ( ( 𝐿 ‘ 𝐸 ) ∩ ( 𝐿 ‘ 𝐺 ) ) = ( 𝐿 ‘ 𝐺 ) )
31	17 19 21	dvhlmod	⊢ ( 𝜑 → 𝑈 ∈ LMod )
32	8 16 9 10 31 13 14	lkrin	⊢ ( 𝜑 → ( ( 𝐿 ‘ 𝐸 ) ∩ ( 𝐿 ‘ 𝐺 ) ) ⊆ ( 𝐿 ‘ ( 𝐸 + 𝐺 ) ) )
33	30 32	eqsstrrd	⊢ ( 𝜑 → ( 𝐿 ‘ 𝐺 ) ⊆ ( 𝐿 ‘ ( 𝐸 + 𝐺 ) ) )