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 41373

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 6845	. . . . . . . . . . . . . 14 ⊢ ((𝐿‘𝐺) = 𝑉 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = ( ⊥ ‘( ⊥ ‘𝑉)))
10	2, 4, 3, 5, 7	dochoc1 41348	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ( ⊥ ‘( ⊥ ‘𝑉)) = 𝑉)
11	9, 10	sylan9eqr 2786	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝐿‘𝐺) = 𝑉) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = 𝑉)
12		simpr 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝐿‘𝐺) = 𝑉) → (𝐿‘𝐺) = 𝑉)
13	11, 12	eqtr4d 2767	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝐿‘𝐺) = 𝑉) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺))
14	13	ex 412	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐿‘𝐺) = 𝑉 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺)))
15	14	necon3d 2946	. . . . . . . . . 10 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺) → (𝐿‘𝐺) ≠ 𝑉))
16		df-ne 2926	. . . . . . . . . . 11 ⊢ ((𝐿‘𝐺) ≠ 𝑉 ↔ ¬ (𝐿‘𝐺) = 𝑉)
17		dochkrshp.f	. . . . . . . . . . . . . 14 ⊢ 𝐹 = (LFnl‘𝑈)
18		dochkrshp.l	. . . . . . . . . . . . . 14 ⊢ 𝐿 = (LKer‘𝑈)
19	2, 4, 7	dvhlvec 41096	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑈 ∈ LVec)
20		dochkrshp.g	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐺 ∈ 𝐹)
21	5, 6, 17, 18, 19, 20	lkrshpor 39093	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝐿‘𝐺) ∈ 𝑌 ∨ (𝐿‘𝐺) = 𝑉))
22	21	orcomd 871	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐿‘𝐺) = 𝑉 ∨ (𝐿‘𝐺) ∈ 𝑌))
23	22	ord 864	. . . . . . . . . . 11 ⊢ (𝜑 → (¬ (𝐿‘𝐺) = 𝑉 → (𝐿‘𝐺) ∈ 𝑌))
24	16, 23	biimtrid 242	. . . . . . . . . 10 ⊢ (𝜑 → ((𝐿‘𝐺) ≠ 𝑉 → (𝐿‘𝐺) ∈ 𝑌))
25	15, 24	syld 47	. . . . . . . . 9 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺) → (𝐿‘𝐺) ∈ 𝑌))
26	25	imp 406	. . . . . . . 8 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺)) → (𝐿‘𝐺) ∈ 𝑌)
27	2, 3, 4, 5, 6, 8, 26	dochshpncl 41371	. . . . . . 7 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺)) → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺) ↔ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = 𝑉))
28	1, 27	mpbid 232	. . . . . 6 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺)) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = 𝑉)
29	28	ex 412	. . . . 5 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = 𝑉))
30	29	necon1d 2947	. . . 4 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺)))
31	11	ex 412	. . . . . 6 ⊢ (𝜑 → ((𝐿‘𝐺) = 𝑉 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = 𝑉))
32	31	necon3ad 2938	. . . . 5 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 → ¬ (𝐿‘𝐺) = 𝑉))
33	32, 23	syld 47	. . . 4 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 → (𝐿‘𝐺) ∈ 𝑌))
34	30, 33	jcad 512	. . 3 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺) ∧ (𝐿‘𝐺) ∈ 𝑌)))
35	2, 3, 4, 17, 6, 18, 7, 20	dochlkr 41372	. . 3 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌 ↔ (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺) ∧ (𝐿‘𝐺) ∈ 𝑌)))
36	34, 35	sylibrd 259	. 2 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌))
37	2, 4, 7	dvhlmod 41097	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ LMod)
38	37	adantr 480	. . . 4 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → 𝑈 ∈ LMod)
39		simpr 484	. . . 4 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌)
40	5, 6, 38, 39	lshpne 38968	. . 3 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉)
41	40	ex 412	. 2 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉))
42	36, 41	impbid 212	1 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 ↔ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ‘cfv 6499 Basecbs 17155 LModclmod 20798 LSHypclsh 38961 LFnlclfn 39043 LKerclk 39071 HLchlt 39336 LHypclh 39971 DVecHcdvh 41065 ocHcoch 41334

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 ax-riotaBAD 38939

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4868 df-int 4907 df-iun 4953 df-iin 4954 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-1st 7947 df-2nd 7948 df-tpos 8182 df-undef 8229 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-1o 8411 df-er 8648 df-map 8778 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-nn 12163 df-2 12225 df-3 12226 df-4 12227 df-5 12228 df-6 12229 df-n0 12419 df-z 12506 df-uz 12770 df-fz 13445 df-struct 17093 df-sets 17110 df-slot 17128 df-ndx 17140 df-base 17156 df-ress 17177 df-plusg 17209 df-mulr 17210 df-sca 17212 df-vsca 17213 df-0g 17380 df-proset 18235 df-poset 18254 df-plt 18269 df-lub 18285 df-glb 18286 df-join 18287 df-meet 18288 df-p0 18364 df-p1 18365 df-lat 18373 df-clat 18440 df-mgm 18549 df-sgrp 18628 df-mnd 18644 df-submnd 18693 df-grp 18850 df-minusg 18851 df-sbg 18852 df-subg 19037 df-cntz 19231 df-lsm 19550 df-cmn 19696 df-abl 19697 df-mgp 20061 df-rng 20073 df-ur 20102 df-ring 20155 df-oppr 20257 df-dvdsr 20277 df-unit 20278 df-invr 20308 df-dvr 20321 df-drng 20651 df-lmod 20800 df-lss 20870 df-lsp 20910 df-lvec 21042 df-lsatoms 38962 df-lshyp 38963 df-lfl 39044 df-lkr 39072 df-oposet 39162 df-ol 39164 df-oml 39165 df-covers 39252 df-ats 39253 df-atl 39284 df-cvlat 39308 df-hlat 39337 df-llines 39485 df-lplanes 39486 df-lvols 39487 df-lines 39488 df-psubsp 39490 df-pmap 39491 df-padd 39783 df-lhyp 39975 df-laut 39976 df-ldil 40091 df-ltrn 40092 df-trl 40146 df-tendo 40742 df-edring 40744 df-disoa 41016 df-dvech 41066 df-dib 41126 df-dic 41160 df-dih 41216 df-doch 41335

This theorem is referenced by: dochkrshp2 41374 dochkrsat 41442

W3C validator