dochkrshp - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > dochkrshp		Structured version Visualization version GIF version

Theorem dochkrshp 40252

Description: The closure of a kernel is a hyperplane iff it doesn't contain all vectors. (Contributed by NM, 1-Nov-2014.)

**Hypotheses**
Ref	Expression
dochkrshp.h	⊢ 𝐻 = (LHyp‘𝐾)
dochkrshp.o	⊢ ⊥ = ((ocH‘𝐾)‘𝑊)
dochkrshp.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
dochkrshp.v	⊢ 𝑉 = (Base‘𝑈)
dochkrshp.y	⊢ 𝑌 = (LSHyp‘𝑈)
dochkrshp.f	⊢ 𝐹 = (LFnl‘𝑈)
dochkrshp.l	⊢ 𝐿 = (LKer‘𝑈)
dochkrshp.k	⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
dochkrshp.g	⊢ (𝜑 → 𝐺 ∈ 𝐹)

**Assertion**
Ref	Expression
dochkrshp	⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 ↔ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌))

**Proof of Theorem dochkrshp**
Step	Hyp	Ref	Expression
1		simpr 485	. . . . . . 7 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺)) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺))
2		dochkrshp.h	. . . . . . . 8 ⊢ 𝐻 = (LHyp‘𝐾)
3		dochkrshp.o	. . . . . . . 8 ⊢ ⊥ = ((ocH‘𝐾)‘𝑊)
4		dochkrshp.u	. . . . . . . 8 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
5		dochkrshp.v	. . . . . . . 8 ⊢ 𝑉 = (Base‘𝑈)
6		dochkrshp.y	. . . . . . . 8 ⊢ 𝑌 = (LSHyp‘𝑈)
7		dochkrshp.k	. . . . . . . . 9 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
8	7	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
9		2fveq3 6896	. . . . . . . . . . . . . 14 ⊢ ((𝐿‘𝐺) = 𝑉 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = ( ⊥ ‘( ⊥ ‘𝑉)))
10	2, 4, 3, 5, 7	dochoc1 40227	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ( ⊥ ‘( ⊥ ‘𝑉)) = 𝑉)
11	9, 10	sylan9eqr 2794	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝐿‘𝐺) = 𝑉) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = 𝑉)
12		simpr 485	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝐿‘𝐺) = 𝑉) → (𝐿‘𝐺) = 𝑉)
13	11, 12	eqtr4d 2775	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝐿‘𝐺) = 𝑉) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺))
14	13	ex 413	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐿‘𝐺) = 𝑉 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺)))
15	14	necon3d 2961	. . . . . . . . . 10 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺) → (𝐿‘𝐺) ≠ 𝑉))
16		df-ne 2941	. . . . . . . . . . 11 ⊢ ((𝐿‘𝐺) ≠ 𝑉 ↔ ¬ (𝐿‘𝐺) = 𝑉)
17		dochkrshp.f	. . . . . . . . . . . . . 14 ⊢ 𝐹 = (LFnl‘𝑈)
18		dochkrshp.l	. . . . . . . . . . . . . 14 ⊢ 𝐿 = (LKer‘𝑈)
19	2, 4, 7	dvhlvec 39975	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑈 ∈ LVec)
20		dochkrshp.g	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐺 ∈ 𝐹)
21	5, 6, 17, 18, 19, 20	lkrshpor 37972	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝐿‘𝐺) ∈ 𝑌 ∨ (𝐿‘𝐺) = 𝑉))
22	21	orcomd 869	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐿‘𝐺) = 𝑉 ∨ (𝐿‘𝐺) ∈ 𝑌))
23	22	ord 862	. . . . . . . . . . 11 ⊢ (𝜑 → (¬ (𝐿‘𝐺) = 𝑉 → (𝐿‘𝐺) ∈ 𝑌))
24	16, 23	biimtrid 241	. . . . . . . . . 10 ⊢ (𝜑 → ((𝐿‘𝐺) ≠ 𝑉 → (𝐿‘𝐺) ∈ 𝑌))
25	15, 24	syld 47	. . . . . . . . 9 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺) → (𝐿‘𝐺) ∈ 𝑌))
26	25	imp 407	. . . . . . . 8 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺)) → (𝐿‘𝐺) ∈ 𝑌)
27	2, 3, 4, 5, 6, 8, 26	dochshpncl 40250	. . . . . . 7 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺)) → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺) ↔ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = 𝑉))
28	1, 27	mpbid 231	. . . . . 6 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺)) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = 𝑉)
29	28	ex 413	. . . . 5 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = 𝑉))
30	29	necon1d 2962	. . . 4 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺)))
31	11	ex 413	. . . . . 6 ⊢ (𝜑 → ((𝐿‘𝐺) = 𝑉 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = 𝑉))
32	31	necon3ad 2953	. . . . 5 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 → ¬ (𝐿‘𝐺) = 𝑉))
33	32, 23	syld 47	. . . 4 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 → (𝐿‘𝐺) ∈ 𝑌))
34	30, 33	jcad 513	. . 3 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺) ∧ (𝐿‘𝐺) ∈ 𝑌)))
35	2, 3, 4, 17, 6, 18, 7, 20	dochlkr 40251	. . 3 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌 ↔ (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺) ∧ (𝐿‘𝐺) ∈ 𝑌)))
36	34, 35	sylibrd 258	. 2 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌))
37	2, 4, 7	dvhlmod 39976	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ LMod)
38	37	adantr 481	. . . 4 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → 𝑈 ∈ LMod)
39		simpr 485	. . . 4 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌)
40	5, 6, 38, 39	lshpne 37847	. . 3 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉)
41	40	ex 413	. 2 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉))
42	36, 41	impbid 211	1 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 ↔ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 ‘cfv 6543 Basecbs 17143 LModclmod 20470 LSHypclsh 37840 LFnlclfn 37922 LKerclk 37950 HLchlt 38215 LHypclh 38850 DVecHcdvh 39944 ocHcoch 40213

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185 ax-pre-mulgt0 11186 ax-riotaBAD 37818

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-tp 4633 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-iin 5000 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7364 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7855 df-1st 7974 df-2nd 7975 df-tpos 8210 df-undef 8257 df-frecs 8265 df-wrecs 8296 df-recs 8370 df-rdg 8409 df-1o 8465 df-er 8702 df-map 8821 df-en 8939 df-dom 8940 df-sdom 8941 df-fin 8942 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11445 df-neg 11446 df-nn 12212 df-2 12274 df-3 12275 df-4 12276 df-5 12277 df-6 12278 df-n0 12472 df-z 12558 df-uz 12822 df-fz 13484 df-struct 17079 df-sets 17096 df-slot 17114 df-ndx 17126 df-base 17144 df-ress 17173 df-plusg 17209 df-mulr 17210 df-sca 17212 df-vsca 17213 df-0g 17386 df-proset 18247 df-poset 18265 df-plt 18282 df-lub 18298 df-glb 18299 df-join 18300 df-meet 18301 df-p0 18377 df-p1 18378 df-lat 18384 df-clat 18451 df-mgm 18560 df-sgrp 18609 df-mnd 18625 df-submnd 18671 df-grp 18821 df-minusg 18822 df-sbg 18823 df-subg 19002 df-cntz 19180 df-lsm 19503 df-cmn 19649 df-abl 19650 df-mgp 19987 df-ur 20004 df-ring 20057 df-oppr 20149 df-dvdsr 20170 df-unit 20171 df-invr 20201 df-dvr 20214 df-drng 20358 df-lmod 20472 df-lss 20542 df-lsp 20582 df-lvec 20713 df-lsatoms 37841 df-lshyp 37842 df-lfl 37923 df-lkr 37951 df-oposet 38041 df-ol 38043 df-oml 38044 df-covers 38131 df-ats 38132 df-atl 38163 df-cvlat 38187 df-hlat 38216 df-llines 38364 df-lplanes 38365 df-lvols 38366 df-lines 38367 df-psubsp 38369 df-pmap 38370 df-padd 38662 df-lhyp 38854 df-laut 38855 df-ldil 38970 df-ltrn 38971 df-trl 39025 df-tendo 39621 df-edring 39623 df-disoa 39895 df-dvech 39945 df-dib 40005 df-dic 40039 df-dih 40095 df-doch 40214

This theorem is referenced by: dochkrshp2 40253 dochkrsat 40321

W3C validator