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 40770

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 484	. . . . . . 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 480	. . . . . . . 8 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
9		2fveq3 6890	. . . . . . . . . . . . . 14 ⊢ ((𝐿‘𝐺) = 𝑉 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = ( ⊥ ‘( ⊥ ‘𝑉)))
10	2, 4, 3, 5, 7	dochoc1 40745	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ( ⊥ ‘( ⊥ ‘𝑉)) = 𝑉)
11	9, 10	sylan9eqr 2788	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝐿‘𝐺) = 𝑉) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = 𝑉)
12		simpr 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝐿‘𝐺) = 𝑉) → (𝐿‘𝐺) = 𝑉)
13	11, 12	eqtr4d 2769	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝐿‘𝐺) = 𝑉) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺))
14	13	ex 412	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐿‘𝐺) = 𝑉 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺)))
15	14	necon3d 2955	. . . . . . . . . 10 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺) → (𝐿‘𝐺) ≠ 𝑉))
16		df-ne 2935	. . . . . . . . . . 11 ⊢ ((𝐿‘𝐺) ≠ 𝑉 ↔ ¬ (𝐿‘𝐺) = 𝑉)
17		dochkrshp.f	. . . . . . . . . . . . . 14 ⊢ 𝐹 = (LFnl‘𝑈)
18		dochkrshp.l	. . . . . . . . . . . . . 14 ⊢ 𝐿 = (LKer‘𝑈)
19	2, 4, 7	dvhlvec 40493	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑈 ∈ LVec)
20		dochkrshp.g	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐺 ∈ 𝐹)
21	5, 6, 17, 18, 19, 20	lkrshpor 38490	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝐿‘𝐺) ∈ 𝑌 ∨ (𝐿‘𝐺) = 𝑉))
22	21	orcomd 868	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐿‘𝐺) = 𝑉 ∨ (𝐿‘𝐺) ∈ 𝑌))
23	22	ord 861	. . . . . . . . . . 11 ⊢ (𝜑 → (¬ (𝐿‘𝐺) = 𝑉 → (𝐿‘𝐺) ∈ 𝑌))
24	16, 23	biimtrid 241	. . . . . . . . . 10 ⊢ (𝜑 → ((𝐿‘𝐺) ≠ 𝑉 → (𝐿‘𝐺) ∈ 𝑌))
25	15, 24	syld 47	. . . . . . . . 9 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺) → (𝐿‘𝐺) ∈ 𝑌))
26	25	imp 406	. . . . . . . 8 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺)) → (𝐿‘𝐺) ∈ 𝑌)
27	2, 3, 4, 5, 6, 8, 26	dochshpncl 40768	. . . . . . 7 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺)) → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺) ↔ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = 𝑉))
28	1, 27	mpbid 231	. . . . . 6 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺)) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = 𝑉)
29	28	ex 412	. . . . 5 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = 𝑉))
30	29	necon1d 2956	. . . 4 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺)))
31	11	ex 412	. . . . . 6 ⊢ (𝜑 → ((𝐿‘𝐺) = 𝑉 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = 𝑉))
32	31	necon3ad 2947	. . . . 5 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 → ¬ (𝐿‘𝐺) = 𝑉))
33	32, 23	syld 47	. . . 4 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 → (𝐿‘𝐺) ∈ 𝑌))
34	30, 33	jcad 512	. . 3 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺) ∧ (𝐿‘𝐺) ∈ 𝑌)))
35	2, 3, 4, 17, 6, 18, 7, 20	dochlkr 40769	. . 3 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌 ↔ (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺) ∧ (𝐿‘𝐺) ∈ 𝑌)))
36	34, 35	sylibrd 259	. 2 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌))
37	2, 4, 7	dvhlmod 40494	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ LMod)
38	37	adantr 480	. . . 4 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → 𝑈 ∈ LMod)
39		simpr 484	. . . 4 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌)
40	5, 6, 38, 39	lshpne 38365	. . 3 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉)
41	40	ex 412	. 2 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉))
42	36, 41	impbid 211	1 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 ↔ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1533 ∈ wcel 2098 ≠ wne 2934 ‘cfv 6537 Basecbs 17153 LModclmod 20706 LSHypclsh 38358 LFnlclfn 38440 LKerclk 38468 HLchlt 38733 LHypclh 39368 DVecHcdvh 40462 ocHcoch 40731

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7722 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-riotaBAD 38336

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-nel 3041 df-ral 3056 df-rex 3065 df-rmo 3370 df-reu 3371 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-pss 3962 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-tp 4628 df-op 4630 df-uni 4903 df-int 4944 df-iun 4992 df-iin 4993 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6294 df-ord 6361 df-on 6362 df-lim 6363 df-suc 6364 df-iota 6489 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7853 df-1st 7974 df-2nd 7975 df-tpos 8212 df-undef 8259 df-frecs 8267 df-wrecs 8298 df-recs 8372 df-rdg 8411 df-1o 8467 df-er 8705 df-map 8824 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-nn 12217 df-2 12279 df-3 12280 df-4 12281 df-5 12282 df-6 12283 df-n0 12477 df-z 12563 df-uz 12827 df-fz 13491 df-struct 17089 df-sets 17106 df-slot 17124 df-ndx 17136 df-base 17154 df-ress 17183 df-plusg 17219 df-mulr 17220 df-sca 17222 df-vsca 17223 df-0g 17396 df-proset 18260 df-poset 18278 df-plt 18295 df-lub 18311 df-glb 18312 df-join 18313 df-meet 18314 df-p0 18390 df-p1 18391 df-lat 18397 df-clat 18464 df-mgm 18573 df-sgrp 18652 df-mnd 18668 df-submnd 18714 df-grp 18866 df-minusg 18867 df-sbg 18868 df-subg 19050 df-cntz 19233 df-lsm 19556 df-cmn 19702 df-abl 19703 df-mgp 20040 df-rng 20058 df-ur 20087 df-ring 20140 df-oppr 20236 df-dvdsr 20259 df-unit 20260 df-invr 20290 df-dvr 20303 df-drng 20589 df-lmod 20708 df-lss 20779 df-lsp 20819 df-lvec 20951 df-lsatoms 38359 df-lshyp 38360 df-lfl 38441 df-lkr 38469 df-oposet 38559 df-ol 38561 df-oml 38562 df-covers 38649 df-ats 38650 df-atl 38681 df-cvlat 38705 df-hlat 38734 df-llines 38882 df-lplanes 38883 df-lvols 38884 df-lines 38885 df-psubsp 38887 df-pmap 38888 df-padd 39180 df-lhyp 39372 df-laut 39373 df-ldil 39488 df-ltrn 39489 df-trl 39543 df-tendo 40139 df-edring 40141 df-disoa 40413 df-dvech 40463 df-dib 40523 df-dic 40557 df-dih 40613 df-doch 40732

This theorem is referenced by: dochkrshp2 40771 dochkrsat 40839

W3C validator