| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dochkrshp | Structured version Visualization version GIF version | ||
| Description: The closure of a kernel is a hyperplane iff it doesn't contain all vectors. (Contributed by NM, 1-Nov-2014.) |
| 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 | ⊢ (𝜑 → 𝐺 ∈ 𝐹) |
| Ref | Expression |
|---|---|
| dochkrshp | ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 ↔ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 489 | . . . . . . 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 485 | . . . . . . . 8 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) |
| 9 | 2fveq3 6887 | . . . . . . . . . . . . . 14 ⊢ ((𝐿‘𝐺) = 𝑉 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = ( ⊥ ‘( ⊥ ‘𝑉))) | |
| 10 | 2, 4, 3, 5, 7 | dochoc1 42025 | . . . . . . . . . . . . . 14 ⊢ (𝜑 → ( ⊥ ‘( ⊥ ‘𝑉)) = 𝑉) |
| 11 | 9, 10 | sylan9eqr 2826 | . . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝐿‘𝐺) = 𝑉) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = 𝑉) |
| 12 | simpr 489 | . . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝐿‘𝐺) = 𝑉) → (𝐿‘𝐺) = 𝑉) | |
| 13 | 11, 12 | eqtr4d 2807 | . . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝐿‘𝐺) = 𝑉) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺)) |
| 14 | 13 | ex 417 | . . . . . . . . . . 11 ⊢ (𝜑 → ((𝐿‘𝐺) = 𝑉 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺))) |
| 15 | 14 | necon3d 2985 | . . . . . . . . . 10 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺) → (𝐿‘𝐺) ≠ 𝑉)) |
| 16 | df-ne 2965 | . . . . . . . . . . 11 ⊢ ((𝐿‘𝐺) ≠ 𝑉 ↔ ¬ (𝐿‘𝐺) = 𝑉) | |
| 17 | dochkrshp.f | . . . . . . . . . . . . . 14 ⊢ 𝐹 = (LFnl‘𝑈) | |
| 18 | dochkrshp.l | . . . . . . . . . . . . . 14 ⊢ 𝐿 = (LKer‘𝑈) | |
| 19 | 2, 4, 7 | dvhlvec 41773 | . . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑈 ∈ LVec) |
| 20 | dochkrshp.g | . . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐺 ∈ 𝐹) | |
| 21 | 5, 6, 17, 18, 19, 20 | lkrshpor 39771 | . . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝐿‘𝐺) ∈ 𝑌 ∨ (𝐿‘𝐺) = 𝑉)) |
| 22 | 21 | orcomd 884 | . . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐿‘𝐺) = 𝑉 ∨ (𝐿‘𝐺) ∈ 𝑌)) |
| 23 | 22 | ord 877 | . . . . . . . . . . 11 ⊢ (𝜑 → (¬ (𝐿‘𝐺) = 𝑉 → (𝐿‘𝐺) ∈ 𝑌)) |
| 24 | 16, 23 | biimtrid 245 | . . . . . . . . . 10 ⊢ (𝜑 → ((𝐿‘𝐺) ≠ 𝑉 → (𝐿‘𝐺) ∈ 𝑌)) |
| 25 | 15, 24 | syld 48 | . . . . . . . . 9 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺) → (𝐿‘𝐺) ∈ 𝑌)) |
| 26 | 25 | imp 411 | . . . . . . . 8 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺)) → (𝐿‘𝐺) ∈ 𝑌) |
| 27 | 2, 3, 4, 5, 6, 8, 26 | dochshpncl 42048 | . . . . . . 7 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺)) → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺) ↔ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = 𝑉)) |
| 28 | 1, 27 | mpbid 235 | . . . . . 6 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺)) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = 𝑉) |
| 29 | 28 | ex 417 | . . . . 5 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ (𝐿‘𝐺) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = 𝑉)) |
| 30 | 29 | necon1d 2986 | . . . 4 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺))) |
| 31 | 11 | ex 417 | . . . . . 6 ⊢ (𝜑 → ((𝐿‘𝐺) = 𝑉 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = 𝑉)) |
| 32 | 31 | necon3ad 2977 | . . . . 5 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 → ¬ (𝐿‘𝐺) = 𝑉)) |
| 33 | 32, 23 | syld 48 | . . . 4 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 → (𝐿‘𝐺) ∈ 𝑌)) |
| 34 | 30, 33 | jcad 521 | . . 3 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺) ∧ (𝐿‘𝐺) ∈ 𝑌))) |
| 35 | 2, 3, 4, 17, 6, 18, 7, 20 | dochlkr 42049 | . . 3 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌 ↔ (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺) ∧ (𝐿‘𝐺) ∈ 𝑌))) |
| 36 | 34, 35 | sylibrd 262 | . 2 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌)) |
| 37 | 2, 4, 7 | dvhlmod 41774 | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ LMod) |
| 38 | 37 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → 𝑈 ∈ LMod) |
| 39 | simpr 489 | . . . 4 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) | |
| 40 | 5, 6, 38, 39 | lshpne 39646 | . . 3 ⊢ ((𝜑 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌) → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉) |
| 41 | 40 | ex 417 | . 2 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉)) |
| 42 | 36, 41 | impbid 215 | 1 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ≠ 𝑉 ↔ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) ∈ 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ‘cfv 6537 Basecbs 17269 LModclmod 20959 LSHypclsh 39639 LFnlclfn 39721 LKerclk 39749 HLchlt 40014 LHypclh 40648 DVecHcdvh 41742 ocHcoch 42011 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 ax-riotaBAD 39617 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-tp 4599 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-iin 4963 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-tpos 8222 df-undef 8269 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-er 8694 df-map 8826 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-n0 12505 df-z 12592 df-uz 12863 df-fz 13536 df-struct 17207 df-sets 17224 df-slot 17242 df-ndx 17254 df-base 17270 df-ress 17291 df-plusg 17323 df-mulr 17324 df-sca 17326 df-vsca 17327 df-0g 17494 df-proset 18350 df-poset 18369 df-plt 18384 df-lub 18400 df-glb 18401 df-join 18402 df-meet 18403 df-p0 18479 df-p1 18480 df-lat 18488 df-clat 18555 df-mgm 18698 df-sgrp 18777 df-mnd 18793 df-submnd 18842 df-grp 19003 df-minusg 19004 df-sbg 19005 df-subg 19189 df-cntz 19387 df-lsm 19706 df-cmn 19852 df-abl 19853 df-mgp 20217 df-rng 20231 df-ur 20264 df-ring 20317 df-oppr 20419 df-dvdsr 20439 df-unit 20440 df-invr 20470 df-dvr 20483 df-drng 20815 df-lmod 20961 df-lss 21031 df-lsp 21071 df-lvec 21202 df-lsatoms 39640 df-lshyp 39641 df-lfl 39722 df-lkr 39750 df-oposet 39840 df-ol 39842 df-oml 39843 df-covers 39930 df-ats 39931 df-atl 39962 df-cvlat 39986 df-hlat 40015 df-llines 40162 df-lplanes 40163 df-lvols 40164 df-lines 40165 df-psubsp 40167 df-pmap 40168 df-padd 40460 df-lhyp 40652 df-laut 40653 df-ldil 40768 df-ltrn 40769 df-trl 40823 df-tendo 41419 df-edring 41421 df-disoa 41693 df-dvech 41743 df-dib 41803 df-dic 41837 df-dih 41893 df-doch 42012 |
| This theorem is referenced by: dochkrshp2 42051 dochkrsat 42119 |
| Copyright terms: Public domain | W3C validator |