| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > lclkrs | Structured version Visualization version GIF version | ||
| Description: The set of functionals having closed kernels and majorizing the orthocomplement of a given subspace 𝑅 is a subspace of the dual space. TODO: This proof repeats large parts of the lclkr 42118 proof. Do we achieve overall shortening by breaking them out as subtheorems? Or make lclkr 42118 a special case of this? (Contributed by NM, 29-Jan-2015.) |
| Ref | Expression |
|---|---|
| lclkrs.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| lclkrs.o | ⊢ ⊥ = ((ocH‘𝐾)‘𝑊) |
| lclkrs.u | ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊) |
| lclkrs.s | ⊢ 𝑆 = (LSubSp‘𝑈) |
| lclkrs.f | ⊢ 𝐹 = (LFnl‘𝑈) |
| lclkrs.l | ⊢ 𝐿 = (LKer‘𝑈) |
| lclkrs.d | ⊢ 𝐷 = (LDual‘𝑈) |
| lclkrs.t | ⊢ 𝑇 = (LSubSp‘𝐷) |
| lclkrs.c | ⊢ 𝐶 = {𝑓 ∈ 𝐹 ∣ (( ⊥ ‘( ⊥ ‘(𝐿‘𝑓))) = (𝐿‘𝑓) ∧ ( ⊥ ‘(𝐿‘𝑓)) ⊆ 𝑅)} |
| lclkrs.k | ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) |
| lclkrs.r | ⊢ (𝜑 → 𝑅 ∈ 𝑆) |
| Ref | Expression |
|---|---|
| lclkrs | ⊢ (𝜑 → 𝐶 ∈ 𝑇) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssrab2 4031 | . . . 4 ⊢ {𝑓 ∈ 𝐹 ∣ (( ⊥ ‘( ⊥ ‘(𝐿‘𝑓))) = (𝐿‘𝑓) ∧ ( ⊥ ‘(𝐿‘𝑓)) ⊆ 𝑅)} ⊆ 𝐹 | |
| 2 | 1 | a1i 11 | . . 3 ⊢ (𝜑 → {𝑓 ∈ 𝐹 ∣ (( ⊥ ‘( ⊥ ‘(𝐿‘𝑓))) = (𝐿‘𝑓) ∧ ( ⊥ ‘(𝐿‘𝑓)) ⊆ 𝑅)} ⊆ 𝐹) |
| 3 | lclkrs.c | . . . 4 ⊢ 𝐶 = {𝑓 ∈ 𝐹 ∣ (( ⊥ ‘( ⊥ ‘(𝐿‘𝑓))) = (𝐿‘𝑓) ∧ ( ⊥ ‘(𝐿‘𝑓)) ⊆ 𝑅)} | |
| 4 | 3 | a1i 11 | . . 3 ⊢ (𝜑 → 𝐶 = {𝑓 ∈ 𝐹 ∣ (( ⊥ ‘( ⊥ ‘(𝐿‘𝑓))) = (𝐿‘𝑓) ∧ ( ⊥ ‘(𝐿‘𝑓)) ⊆ 𝑅)}) |
| 5 | lclkrs.f | . . . 4 ⊢ 𝐹 = (LFnl‘𝑈) | |
| 6 | lclkrs.d | . . . 4 ⊢ 𝐷 = (LDual‘𝑈) | |
| 7 | eqid 2761 | . . . 4 ⊢ (Base‘𝐷) = (Base‘𝐷) | |
| 8 | lclkrs.h | . . . . 5 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 9 | lclkrs.u | . . . . 5 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊) | |
| 10 | lclkrs.k | . . . . 5 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 11 | 8, 9, 10 | dvhlmod 41695 | . . . 4 ⊢ (𝜑 → 𝑈 ∈ LMod) |
| 12 | 5, 6, 7, 11 | ldualvbase 39711 | . . 3 ⊢ (𝜑 → (Base‘𝐷) = 𝐹) |
| 13 | 2, 4, 12 | 3sstr4d 3989 | . 2 ⊢ (𝜑 → 𝐶 ⊆ (Base‘𝐷)) |
| 14 | eqid 2761 | . . . . . 6 ⊢ (Scalar‘𝑈) = (Scalar‘𝑈) | |
| 15 | eqid 2761 | . . . . . 6 ⊢ (0g‘(Scalar‘𝑈)) = (0g‘(Scalar‘𝑈)) | |
| 16 | eqid 2761 | . . . . . 6 ⊢ (Base‘𝑈) = (Base‘𝑈) | |
| 17 | 14, 15, 16, 5 | lfl0f 39654 | . . . . 5 ⊢ (𝑈 ∈ LMod → ((Base‘𝑈) × {(0g‘(Scalar‘𝑈))}) ∈ 𝐹) |
| 18 | 11, 17 | syl 17 | . . . 4 ⊢ (𝜑 → ((Base‘𝑈) × {(0g‘(Scalar‘𝑈))}) ∈ 𝐹) |
| 19 | lclkrs.o | . . . . . 6 ⊢ ⊥ = ((ocH‘𝐾)‘𝑊) | |
| 20 | 8, 9, 19, 16, 10 | dochoc1 41946 | . . . . 5 ⊢ (𝜑 → ( ⊥ ‘( ⊥ ‘(Base‘𝑈))) = (Base‘𝑈)) |
| 21 | eqidd 2762 | . . . . . . . 8 ⊢ (𝜑 → ((Base‘𝑈) × {(0g‘(Scalar‘𝑈))}) = ((Base‘𝑈) × {(0g‘(Scalar‘𝑈))})) | |
| 22 | lclkrs.l | . . . . . . . . . 10 ⊢ 𝐿 = (LKer‘𝑈) | |
| 23 | 14, 15, 16, 5, 22 | lkr0f 39679 | . . . . . . . . 9 ⊢ ((𝑈 ∈ LMod ∧ ((Base‘𝑈) × {(0g‘(Scalar‘𝑈))}) ∈ 𝐹) → ((𝐿‘((Base‘𝑈) × {(0g‘(Scalar‘𝑈))})) = (Base‘𝑈) ↔ ((Base‘𝑈) × {(0g‘(Scalar‘𝑈))}) = ((Base‘𝑈) × {(0g‘(Scalar‘𝑈))}))) |
| 24 | 11, 18, 23 | syl2anc 593 | . . . . . . . 8 ⊢ (𝜑 → ((𝐿‘((Base‘𝑈) × {(0g‘(Scalar‘𝑈))})) = (Base‘𝑈) ↔ ((Base‘𝑈) × {(0g‘(Scalar‘𝑈))}) = ((Base‘𝑈) × {(0g‘(Scalar‘𝑈))}))) |
| 25 | 21, 24 | mpbird 259 | . . . . . . 7 ⊢ (𝜑 → (𝐿‘((Base‘𝑈) × {(0g‘(Scalar‘𝑈))})) = (Base‘𝑈)) |
| 26 | 25 | fveq2d 6866 | . . . . . 6 ⊢ (𝜑 → ( ⊥ ‘(𝐿‘((Base‘𝑈) × {(0g‘(Scalar‘𝑈))}))) = ( ⊥ ‘(Base‘𝑈))) |
| 27 | 26 | fveq2d 6866 | . . . . 5 ⊢ (𝜑 → ( ⊥ ‘( ⊥ ‘(𝐿‘((Base‘𝑈) × {(0g‘(Scalar‘𝑈))})))) = ( ⊥ ‘( ⊥ ‘(Base‘𝑈)))) |
| 28 | 20, 27, 25 | 3eqtr4d 2806 | . . . 4 ⊢ (𝜑 → ( ⊥ ‘( ⊥ ‘(𝐿‘((Base‘𝑈) × {(0g‘(Scalar‘𝑈))})))) = (𝐿‘((Base‘𝑈) × {(0g‘(Scalar‘𝑈))}))) |
| 29 | eqid 2761 | . . . . . . . 8 ⊢ (0g‘𝑈) = (0g‘𝑈) | |
| 30 | 8, 9, 19, 16, 29 | doch1 41944 | . . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ( ⊥ ‘(Base‘𝑈)) = {(0g‘𝑈)}) |
| 31 | 10, 30 | syl 17 | . . . . . 6 ⊢ (𝜑 → ( ⊥ ‘(Base‘𝑈)) = {(0g‘𝑈)}) |
| 32 | 26, 31 | eqtrd 2796 | . . . . 5 ⊢ (𝜑 → ( ⊥ ‘(𝐿‘((Base‘𝑈) × {(0g‘(Scalar‘𝑈))}))) = {(0g‘𝑈)}) |
| 33 | lclkrs.r | . . . . . 6 ⊢ (𝜑 → 𝑅 ∈ 𝑆) | |
| 34 | lclkrs.s | . . . . . . 7 ⊢ 𝑆 = (LSubSp‘𝑈) | |
| 35 | 29, 34 | lss0ss 21004 | . . . . . 6 ⊢ ((𝑈 ∈ LMod ∧ 𝑅 ∈ 𝑆) → {(0g‘𝑈)} ⊆ 𝑅) |
| 36 | 11, 33, 35 | syl2anc 593 | . . . . 5 ⊢ (𝜑 → {(0g‘𝑈)} ⊆ 𝑅) |
| 37 | 32, 36 | eqsstrd 3968 | . . . 4 ⊢ (𝜑 → ( ⊥ ‘(𝐿‘((Base‘𝑈) × {(0g‘(Scalar‘𝑈))}))) ⊆ 𝑅) |
| 38 | 3 | lcfls1lem 42119 | . . . 4 ⊢ (((Base‘𝑈) × {(0g‘(Scalar‘𝑈))}) ∈ 𝐶 ↔ (((Base‘𝑈) × {(0g‘(Scalar‘𝑈))}) ∈ 𝐹 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘((Base‘𝑈) × {(0g‘(Scalar‘𝑈))})))) = (𝐿‘((Base‘𝑈) × {(0g‘(Scalar‘𝑈))})) ∧ ( ⊥ ‘(𝐿‘((Base‘𝑈) × {(0g‘(Scalar‘𝑈))}))) ⊆ 𝑅)) |
| 39 | 18, 28, 37, 38 | syl3anbrc 1356 | . . 3 ⊢ (𝜑 → ((Base‘𝑈) × {(0g‘(Scalar‘𝑈))}) ∈ 𝐶) |
| 40 | 39 | ne0d 4292 | . 2 ⊢ (𝜑 → 𝐶 ≠ ∅) |
| 41 | eqid 2761 | . . . 4 ⊢ (Base‘(Scalar‘𝑈)) = (Base‘(Scalar‘𝑈)) | |
| 42 | eqid 2761 | . . . 4 ⊢ ( ·𝑠 ‘𝐷) = ( ·𝑠 ‘𝐷) | |
| 43 | 10 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) |
| 44 | 33 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → 𝑅 ∈ 𝑆) |
| 45 | simpr3 1209 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → 𝑏 ∈ 𝐶) | |
| 46 | eqid 2761 | . . . 4 ⊢ (+g‘𝐷) = (+g‘𝐷) | |
| 47 | simpr2 1208 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → 𝑎 ∈ 𝐶) | |
| 48 | simpr1 1207 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → 𝑥 ∈ (Base‘(Scalar‘𝐷))) | |
| 49 | eqid 2761 | . . . . . . . 8 ⊢ (Scalar‘𝐷) = (Scalar‘𝐷) | |
| 50 | eqid 2761 | . . . . . . . 8 ⊢ (Base‘(Scalar‘𝐷)) = (Base‘(Scalar‘𝐷)) | |
| 51 | 14, 41, 6, 49, 50, 11 | ldualsbase 39718 | . . . . . . 7 ⊢ (𝜑 → (Base‘(Scalar‘𝐷)) = (Base‘(Scalar‘𝑈))) |
| 52 | 51 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → (Base‘(Scalar‘𝐷)) = (Base‘(Scalar‘𝑈))) |
| 53 | 48, 52 | eleqtrd 2863 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → 𝑥 ∈ (Base‘(Scalar‘𝑈))) |
| 54 | 8, 19, 9, 34, 5, 22, 6, 14, 41, 42, 3, 43, 44, 47, 53 | lclkrslem1 42122 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → (𝑥( ·𝑠 ‘𝐷)𝑎) ∈ 𝐶) |
| 55 | 8, 19, 9, 34, 5, 22, 6, 14, 41, 42, 3, 43, 44, 45, 46, 54 | lclkrslem2 42123 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → ((𝑥( ·𝑠 ‘𝐷)𝑎)(+g‘𝐷)𝑏) ∈ 𝐶) |
| 56 | 55 | ralrimivvva 3207 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ (Base‘(Scalar‘𝐷))∀𝑎 ∈ 𝐶 ∀𝑏 ∈ 𝐶 ((𝑥( ·𝑠 ‘𝐷)𝑎)(+g‘𝐷)𝑏) ∈ 𝐶) |
| 57 | lclkrs.t | . . 3 ⊢ 𝑇 = (LSubSp‘𝐷) | |
| 58 | 49, 50, 7, 46, 42, 57 | islss 20989 | . 2 ⊢ (𝐶 ∈ 𝑇 ↔ (𝐶 ⊆ (Base‘𝐷) ∧ 𝐶 ≠ ∅ ∧ ∀𝑥 ∈ (Base‘(Scalar‘𝐷))∀𝑎 ∈ 𝐶 ∀𝑏 ∈ 𝐶 ((𝑥( ·𝑠 ‘𝐷)𝑎)(+g‘𝐷)𝑏) ∈ 𝐶)) |
| 59 | 13, 40, 56, 58 | syl3anbrc 1356 | 1 ⊢ (𝜑 → 𝐶 ∈ 𝑇) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 ∀wral 3075 {crab 3413 ⊆ wss 3902 ∅c0 4283 {csn 4579 × cxp 5641 ‘cfv 6516 (class class class)co 7391 Basecbs 17236 +gcplusg 17277 Scalarcsca 17280 ·𝑠 cvsca 17281 0gc0g 17459 LModclmod 20915 LSubSpclss 20986 LFnlclfn 39642 LKerclk 39670 LDualcld 39708 HLchlt 39935 LHypclh 40569 DVecHcdvh 41663 ocHcoch 41932 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 ax-riotaBAD 39538 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-tp 4584 df-op 4586 df-uni 4863 df-int 4903 df-iun 4948 df-iin 4949 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-of 7655 df-om 7842 df-1st 7965 df-2nd 7966 df-tpos 8200 df-undef 8247 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-1o 8431 df-2o 8432 df-er 8672 df-map 8804 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-nn 12205 df-2 12274 df-3 12275 df-4 12276 df-5 12277 df-6 12278 df-n0 12476 df-z 12563 df-uz 12834 df-fz 13507 df-struct 17174 df-sets 17191 df-slot 17209 df-ndx 17221 df-base 17237 df-ress 17258 df-plusg 17290 df-mulr 17291 df-sca 17293 df-vsca 17294 df-0g 17461 df-mre 17605 df-mrc 17606 df-acs 17608 df-proset 18317 df-poset 18336 df-plt 18351 df-lub 18367 df-glb 18368 df-join 18369 df-meet 18370 df-p0 18446 df-p1 18447 df-lat 18455 df-clat 18522 df-mgm 18665 df-sgrp 18744 df-mnd 18760 df-submnd 18809 df-grp 18969 df-minusg 18970 df-sbg 18971 df-subg 19156 df-cntz 19348 df-oppg 19377 df-lsm 19667 df-cmn 19813 df-abl 19814 df-mgp 20178 df-rng 20190 df-ur 20219 df-ring 20272 df-oppr 20373 df-dvdsr 20393 df-unit 20394 df-invr 20424 df-dvr 20437 df-nzr 20550 df-rlreg 20731 df-domn 20732 df-drng 20768 df-lmod 20917 df-lss 20987 df-lsp 21027 df-lvec 21158 df-lsatoms 39561 df-lshyp 39562 df-lcv 39604 df-lfl 39643 df-lkr 39671 df-ldual 39709 df-oposet 39761 df-ol 39763 df-oml 39764 df-covers 39851 df-ats 39852 df-atl 39883 df-cvlat 39907 df-hlat 39936 df-llines 40083 df-lplanes 40084 df-lvols 40085 df-lines 40086 df-psubsp 40088 df-pmap 40089 df-padd 40381 df-lhyp 40573 df-laut 40574 df-ldil 40689 df-ltrn 40690 df-trl 40744 df-tgrp 41328 df-tendo 41340 df-edring 41342 df-dveca 41588 df-disoa 41614 df-dvech 41664 df-dib 41724 df-dic 41758 df-dih 41814 df-doch 41933 df-djh 41980 |
| This theorem is referenced by: lclkrs2 42125 mapddlssN 42225 |
| Copyright terms: Public domain | W3C validator |