Metamath Proof Explorer


Theorem lsppratlem5

Description: Lemma for lspprat . Combine the two cases and show a contradiction to U C. ( N{ X , Y } ) under the assumptions on x and y . (Contributed by NM, 29-Aug-2014)

Ref Expression
Hypotheses lspprat.v V=BaseW
lspprat.s S=LSubSpW
lspprat.n N=LSpanW
lspprat.w φWLVec
lspprat.u φUS
lspprat.x φXV
lspprat.y φYV
lspprat.p φUNXY
lsppratlem1.o 0˙=0W
lsppratlem1.x2 φxU0˙
lsppratlem1.y2 φyUNx
Assertion lsppratlem5 φNXYU

Proof

Step Hyp Ref Expression
1 lspprat.v V=BaseW
2 lspprat.s S=LSubSpW
3 lspprat.n N=LSpanW
4 lspprat.w φWLVec
5 lspprat.u φUS
6 lspprat.x φXV
7 lspprat.y φYV
8 lspprat.p φUNXY
9 lsppratlem1.o 0˙=0W
10 lsppratlem1.x2 φxU0˙
11 lsppratlem1.y2 φyUNx
12 4 adantr φxNYWLVec
13 5 adantr φxNYUS
14 6 adantr φxNYXV
15 7 adantr φxNYYV
16 8 adantr φxNYUNXY
17 10 adantr φxNYxU0˙
18 11 adantr φxNYyUNx
19 simpr φxNYxNY
20 1 2 3 12 13 14 15 16 9 17 18 19 lsppratlem3 φxNYXNxyYNxy
21 4 adantr φXNxYWLVec
22 5 adantr φXNxYUS
23 6 adantr φXNxYXV
24 7 adantr φXNxYYV
25 8 adantr φXNxYUNXY
26 10 adantr φXNxYxU0˙
27 11 adantr φXNxYyUNx
28 simpr φXNxYXNxY
29 1 2 3 21 22 23 24 25 9 26 27 28 lsppratlem4 φXNxYXNxyYNxy
30 1 2 3 4 5 6 7 8 9 10 11 lsppratlem1 φxNYXNxY
31 20 29 30 mpjaodan φXNxyYNxy
32 4 adantr φXNxyYNxyWLVec
33 5 adantr φXNxyYNxyUS
34 6 adantr φXNxyYNxyXV
35 7 adantr φXNxyYNxyYV
36 8 adantr φXNxyYNxyUNXY
37 10 adantr φXNxyYNxyxU0˙
38 11 adantr φXNxyYNxyyUNx
39 simprl φXNxyYNxyXNxy
40 simprr φXNxyYNxyYNxy
41 1 2 3 32 33 34 35 36 9 37 38 39 40 lsppratlem2 φXNxyYNxyNXYU
42 31 41 mpdan φNXYU