dochlkr - Mathbox for Norm Megill

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

Theorem dochlkr 41645

Description: Equivalent conditions for the closure of a kernel to be a hyperplane. (Contributed by NM, 29-Oct-2014.)

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

**Assertion**
Ref	Expression
dochlkr	⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌 ↔ (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺) ∧ (𝐿‘𝐺) ∈ 𝑌)))

**Proof of Theorem dochlkr**
Step	Hyp	Ref	Expression
1		dochlkr.k	. . . . . . . 8 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		eqid 2736	. . . . . . . . 9 ⊢ (Base‘𝑈) = (Base‘𝑈)
3		dochlkr.f	. . . . . . . . 9 ⊢ 𝐹 = (LFnl‘𝑈)
4		dochlkr.l	. . . . . . . . 9 ⊢ 𝐿 = (LKer‘𝑈)
5		dochlkr.h	. . . . . . . . . 10 ⊢ 𝐻 = (LHyp‘𝐾)
6		dochlkr.u	. . . . . . . . . 10 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
7	5, 6, 1	dvhlmod 41370	. . . . . . . . 9 ⊢ (𝜑 → 𝑈 ∈ LMod)
8		dochlkr.g	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 ∈ 𝐹)
9	2, 3, 4, 7, 8	lkrssv 39356	. . . . . . . 8 ⊢ (𝜑 → (𝐿‘𝐺) ⊆ (Base‘𝑈))
10		dochlkr.o	. . . . . . . . 9 ⊢ ⊥ = ((ocH‘𝐾)‘𝑊)
11	5, 6, 2, 10	dochocss 41626	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐿‘𝐺) ⊆ (Base‘𝑈)) → (𝐿‘𝐺) ⊆ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))))
12	1, 9, 11	syl2anc 584	. . . . . . 7 ⊢ (𝜑 → (𝐿‘𝐺) ⊆ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))))
13	12	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → (𝐿‘𝐺) ⊆ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))))
14		dochlkr.y	. . . . . . 7 ⊢ 𝑌 = (LSHyp‘𝑈)
15	5, 6, 1	dvhlvec 41369	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ LVec)
16	15	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → 𝑈 ∈ LVec)
17	7	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → 𝑈 ∈ LMod)
18		simpr 484	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌)
19	2, 14, 17, 18	lshpne 39242	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (Base‘𝑈))
20	19	ex 412	. . . . . . . . 9 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (Base‘𝑈)))
21	2, 14, 3, 4, 15, 8	lkrshpor 39367	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐿‘𝐺) ∈ 𝑌 ∨ (𝐿‘𝐺) = (Base‘𝑈)))
22	21	ord 864	. . . . . . . . . . 11 ⊢ (𝜑 → (¬ (𝐿‘𝐺) ∈ 𝑌 → (𝐿‘𝐺) = (Base‘𝑈)))
23		2fveq3 6839	. . . . . . . . . . . . . 14 ⊢ ((𝐿‘𝐺) = (Base‘𝑈) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = ( ⊥ ‘( ⊥ ‘(Base‘𝑈))))
24	23	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝐿‘𝐺) = (Base‘𝑈)) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = ( ⊥ ‘( ⊥ ‘(Base‘𝑈))))
25	1	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝐿‘𝐺) = (Base‘𝑈)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
26	5, 6, 10, 2, 25	dochoc1 41621	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝐿‘𝐺) = (Base‘𝑈)) → ( ⊥ ‘( ⊥ ‘(Base‘𝑈))) = (Base‘𝑈))
27	24, 26	eqtrd 2771	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝐿‘𝐺) = (Base‘𝑈)) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (Base‘𝑈))
28	27	ex 412	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐿‘𝐺) = (Base‘𝑈) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (Base‘𝑈)))
29	22, 28	syld 47	. . . . . . . . . 10 ⊢ (𝜑 → (¬ (𝐿‘𝐺) ∈ 𝑌 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (Base‘𝑈)))
30	29	necon1ad 2949	. . . . . . . . 9 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (Base‘𝑈) → (𝐿‘𝐺) ∈ 𝑌))
31	20, 30	syld 47	. . . . . . . 8 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌 → (𝐿‘𝐺) ∈ 𝑌))
32	31	imp 406	. . . . . . 7 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → (𝐿‘𝐺) ∈ 𝑌)
33	14, 16, 32, 18	lshpcmp 39248	. . . . . 6 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → ((𝐿‘𝐺) ⊆ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ↔ (𝐿‘𝐺) = ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺)))))
34	13, 33	mpbid 232	. . . . 5 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → (𝐿‘𝐺) = ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))))
35	34	eqcomd 2742	. . . 4 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺))
36	35, 32	jca 511	. . 3 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺) ∧ (𝐿‘𝐺) ∈ 𝑌))
37	36	ex 412	. 2 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺) ∧ (𝐿‘𝐺) ∈ 𝑌)))
38		eleq1 2824	. . 3 ⊢ (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺) → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌 ↔ (𝐿‘𝐺) ∈ 𝑌))
39	38	biimpar 477	. 2 ⊢ ((( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺) ∧ (𝐿‘𝐺) ∈ 𝑌) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌)
40	37, 39	impbid1 225	1 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌 ↔ (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺) ∧ (𝐿‘𝐺) ∈ 𝑌)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 ⊆ wss 3901 ‘cfv 6492 Basecbs 17136 LModclmod 20811 LVecclvec 21054 LSHypclsh 39235 LFnlclfn 39317 LKerclk 39345 HLchlt 39610 LHypclh 40244 DVecHcdvh 41338 ocHcoch 41607

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-riotaBAD 39213

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-tp 4585 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-iin 4949 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-tpos 8168 df-undef 8215 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-2 12208 df-3 12209 df-4 12210 df-5 12211 df-6 12212 df-n0 12402 df-z 12489 df-uz 12752 df-fz 13424 df-struct 17074 df-sets 17091 df-slot 17109 df-ndx 17121 df-base 17137 df-ress 17158 df-plusg 17190 df-mulr 17191 df-sca 17193 df-vsca 17194 df-0g 17361 df-proset 18217 df-poset 18236 df-plt 18251 df-lub 18267 df-glb 18268 df-join 18269 df-meet 18270 df-p0 18346 df-p1 18347 df-lat 18355 df-clat 18422 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-submnd 18709 df-grp 18866 df-minusg 18867 df-sbg 18868 df-subg 19053 df-cntz 19246 df-lsm 19565 df-cmn 19711 df-abl 19712 df-mgp 20076 df-rng 20088 df-ur 20117 df-ring 20170 df-oppr 20273 df-dvdsr 20293 df-unit 20294 df-invr 20324 df-dvr 20337 df-drng 20664 df-lmod 20813 df-lss 20883 df-lsp 20923 df-lvec 21055 df-lsatoms 39236 df-lshyp 39237 df-lfl 39318 df-lkr 39346 df-oposet 39436 df-ol 39438 df-oml 39439 df-covers 39526 df-ats 39527 df-atl 39558 df-cvlat 39582 df-hlat 39611 df-llines 39758 df-lplanes 39759 df-lvols 39760 df-lines 39761 df-psubsp 39763 df-pmap 39764 df-padd 40056 df-lhyp 40248 df-laut 40249 df-ldil 40364 df-ltrn 40365 df-trl 40419 df-tendo 41015 df-edring 41017 df-disoa 41289 df-dvech 41339 df-dib 41399 df-dic 41433 df-dih 41489 df-doch 41608

This theorem is referenced by: dochkrshp 41646 dochkrshp2 41647 mapdordlem1a 41894 mapdordlem2 41897

W3C validator