lclkrs - Mathbox for Norm Megill

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

Theorem lclkrs 41658

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 41652 proof. Do we achieve overall shortening by breaking them out as subtheorems? Or make lclkr 41652 a special case of this? (Contributed by NM, 29-Jan-2015.)

**Hypotheses**
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	⊢ (𝜑 → 𝑅 ∈ 𝑆)

**Assertion**
Ref	Expression
lclkrs	⊢ (𝜑 → 𝐶 ∈ 𝑇)

Distinct variable groups: 𝐷,𝑓 𝑓,𝐹 𝑓,𝐿 𝑅,𝑓 𝑈,𝑓 ⊥ ,𝑓 Allowed substitution hints: 𝜑(𝑓) 𝐶(𝑓) 𝑆(𝑓) 𝑇(𝑓) 𝐻(𝑓) 𝐾(𝑓) 𝑊(𝑓)

Proof of Theorem lclkrs Dummy variables 𝑎 𝑏 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssrab2 4029	. . . 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 2733	. . . 4 ⊢ (Base‘𝐷) = (Base‘𝐷)
8		lclkrs.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
9		lclkrs.u	. . . . 5 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
10		lclkrs.k	. . . . 5 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
11	8, 9, 10	dvhlmod 41229	. . . 4 ⊢ (𝜑 → 𝑈 ∈ LMod)
12	5, 6, 7, 11	ldualvbase 39245	. . 3 ⊢ (𝜑 → (Base‘𝐷) = 𝐹)
13	2, 4, 12	3sstr4d 3986	. 2 ⊢ (𝜑 → 𝐶 ⊆ (Base‘𝐷))
14		eqid 2733	. . . . . 6 ⊢ (Scalar‘𝑈) = (Scalar‘𝑈)
15		eqid 2733	. . . . . 6 ⊢ (0_g‘(Scalar‘𝑈)) = (0_g‘(Scalar‘𝑈))
16		eqid 2733	. . . . . 6 ⊢ (Base‘𝑈) = (Base‘𝑈)
17	14, 15, 16, 5	lfl0f 39188	. . . . 5 ⊢ (𝑈 ∈ LMod → ((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}) ∈ 𝐹)
18	11, 17	syl 17	. . . 4 ⊢ (𝜑 → ((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}) ∈ 𝐹)
19		lclkrs.o	. . . . . 6 ⊢ ⊥ = ((ocH‘𝐾)‘𝑊)
20	8, 9, 19, 16, 10	dochoc1 41480	. . . . 5 ⊢ (𝜑 → ( ⊥ ‘( ⊥ ‘(Base‘𝑈))) = (Base‘𝑈))
21		eqidd 2734	. . . . . . . 8 ⊢ (𝜑 → ((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}) = ((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}))
22		lclkrs.l	. . . . . . . . . 10 ⊢ 𝐿 = (LKer‘𝑈)
23	14, 15, 16, 5, 22	lkr0f 39213	. . . . . . . . 9 ⊢ ((𝑈 ∈ LMod ∧ ((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}) ∈ 𝐹) → ((𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))})) = (Base‘𝑈) ↔ ((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}) = ((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))})))
24	11, 18, 23	syl2anc 584	. . . . . . . 8 ⊢ (𝜑 → ((𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))})) = (Base‘𝑈) ↔ ((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}) = ((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))})))
25	21, 24	mpbird 257	. . . . . . 7 ⊢ (𝜑 → (𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))})) = (Base‘𝑈))
26	25	fveq2d 6832	. . . . . 6 ⊢ (𝜑 → ( ⊥ ‘(𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}))) = ( ⊥ ‘(Base‘𝑈)))
27	26	fveq2d 6832	. . . . 5 ⊢ (𝜑 → ( ⊥ ‘( ⊥ ‘(𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))})))) = ( ⊥ ‘( ⊥ ‘(Base‘𝑈))))
28	20, 27, 25	3eqtr4d 2778	. . . 4 ⊢ (𝜑 → ( ⊥ ‘( ⊥ ‘(𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))})))) = (𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))})))
29		eqid 2733	. . . . . . . 8 ⊢ (0_g‘𝑈) = (0_g‘𝑈)
30	8, 9, 19, 16, 29	doch1 41478	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ( ⊥ ‘(Base‘𝑈)) = {(0_g‘𝑈)})
31	10, 30	syl 17	. . . . . 6 ⊢ (𝜑 → ( ⊥ ‘(Base‘𝑈)) = {(0_g‘𝑈)})
32	26, 31	eqtrd 2768	. . . . 5 ⊢ (𝜑 → ( ⊥ ‘(𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}))) = {(0_g‘𝑈)})
33		lclkrs.r	. . . . . 6 ⊢ (𝜑 → 𝑅 ∈ 𝑆)
34		lclkrs.s	. . . . . . 7 ⊢ 𝑆 = (LSubSp‘𝑈)
35	29, 34	lss0ss 20884	. . . . . 6 ⊢ ((𝑈 ∈ LMod ∧ 𝑅 ∈ 𝑆) → {(0_g‘𝑈)} ⊆ 𝑅)
36	11, 33, 35	syl2anc 584	. . . . 5 ⊢ (𝜑 → {(0_g‘𝑈)} ⊆ 𝑅)
37	32, 36	eqsstrd 3965	. . . 4 ⊢ (𝜑 → ( ⊥ ‘(𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}))) ⊆ 𝑅)
38	3	lcfls1lem 41653	. . . 4 ⊢ (((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}) ∈ 𝐶 ↔ (((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}) ∈ 𝐹 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))})))) = (𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))})) ∧ ( ⊥ ‘(𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}))) ⊆ 𝑅))
39	18, 28, 37, 38	syl3anbrc 1344	. . 3 ⊢ (𝜑 → ((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}) ∈ 𝐶)
40	39	ne0d 4291	. 2 ⊢ (𝜑 → 𝐶 ≠ ∅)
41		eqid 2733	. . . 4 ⊢ (Base‘(Scalar‘𝑈)) = (Base‘(Scalar‘𝑈))
42		eqid 2733	. . . 4 ⊢ ( ·_𝑠 ‘𝐷) = ( ·_𝑠 ‘𝐷)
43	10	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
44	33	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → 𝑅 ∈ 𝑆)
45		simpr3 1197	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → 𝑏 ∈ 𝐶)
46		eqid 2733	. . . 4 ⊢ (+_g‘𝐷) = (+_g‘𝐷)
47		simpr2 1196	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → 𝑎 ∈ 𝐶)
48		simpr1 1195	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → 𝑥 ∈ (Base‘(Scalar‘𝐷)))
49		eqid 2733	. . . . . . . 8 ⊢ (Scalar‘𝐷) = (Scalar‘𝐷)
50		eqid 2733	. . . . . . . 8 ⊢ (Base‘(Scalar‘𝐷)) = (Base‘(Scalar‘𝐷))
51	14, 41, 6, 49, 50, 11	ldualsbase 39252	. . . . . . 7 ⊢ (𝜑 → (Base‘(Scalar‘𝐷)) = (Base‘(Scalar‘𝑈)))
52	51	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → (Base‘(Scalar‘𝐷)) = (Base‘(Scalar‘𝑈)))
53	48, 52	eleqtrd 2835	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → 𝑥 ∈ (Base‘(Scalar‘𝑈)))
54	8, 19, 9, 34, 5, 22, 6, 14, 41, 42, 3, 43, 44, 47, 53	lclkrslem1 41656	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → (𝑥( ·_𝑠 ‘𝐷)𝑎) ∈ 𝐶)
55	8, 19, 9, 34, 5, 22, 6, 14, 41, 42, 3, 43, 44, 45, 46, 54	lclkrslem2 41657	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → ((𝑥( ·_𝑠 ‘𝐷)𝑎)(+_g‘𝐷)𝑏) ∈ 𝐶)
56	55	ralrimivvva 3179	. 2 ⊢ (𝜑 → ∀𝑥 ∈ (Base‘(Scalar‘𝐷))∀𝑎 ∈ 𝐶 ∀𝑏 ∈ 𝐶 ((𝑥( ·_𝑠 ‘𝐷)𝑎)(+_g‘𝐷)𝑏) ∈ 𝐶)
57		lclkrs.t	. . 3 ⊢ 𝑇 = (LSubSp‘𝐷)
58	49, 50, 7, 46, 42, 57	islss 20869	. 2 ⊢ (𝐶 ∈ 𝑇 ↔ (𝐶 ⊆ (Base‘𝐷) ∧ 𝐶 ≠ ∅ ∧ ∀𝑥 ∈ (Base‘(Scalar‘𝐷))∀𝑎 ∈ 𝐶 ∀𝑏 ∈ 𝐶 ((𝑥( ·_𝑠 ‘𝐷)𝑎)(+_g‘𝐷)𝑏) ∈ 𝐶))
59	13, 40, 56, 58	syl3anbrc 1344	1 ⊢ (𝜑 → 𝐶 ∈ 𝑇)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ≠ wne 2929 ∀wral 3048 {crab 3396 ⊆ wss 3898 ∅c0 4282 {csn 4575 × cxp 5617 ‘cfv 6486 (class class class)co 7352 Basecbs 17122 +_gcplusg 17163 Scalarcsca 17166 ·_𝑠 cvsca 17167 0_gc0g 17345 LModclmod 20795 LSubSpclss 20866 LFnlclfn 39176 LKerclk 39204 LDualcld 39242 HLchlt 39469 LHypclh 40103 DVecHcdvh 41197 ocHcoch 41466

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 2182 ax-ext 2705 ax-rep 5219 ax-sep 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 ax-un 7674 ax-cnex 11069 ax-resscn 11070 ax-1cn 11071 ax-icn 11072 ax-addcl 11073 ax-addrcl 11074 ax-mulcl 11075 ax-mulrcl 11076 ax-mulcom 11077 ax-addass 11078 ax-mulass 11079 ax-distr 11080 ax-i2m1 11081 ax-1ne0 11082 ax-1rid 11083 ax-rnegex 11084 ax-rrecex 11085 ax-cnre 11086 ax-pre-lttri 11087 ax-pre-lttrn 11088 ax-pre-ltadd 11089 ax-pre-mulgt0 11090 ax-riotaBAD 39072

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 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-tp 4580 df-op 4582 df-uni 4859 df-int 4898 df-iun 4943 df-iin 4944 df-br 5094 df-opab 5156 df-mpt 5175 df-tr 5201 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7309 df-ov 7355 df-oprab 7356 df-mpo 7357 df-of 7616 df-om 7803 df-1st 7927 df-2nd 7928 df-tpos 8162 df-undef 8209 df-frecs 8217 df-wrecs 8248 df-recs 8297 df-rdg 8335 df-1o 8391 df-2o 8392 df-er 8628 df-map 8758 df-en 8876 df-dom 8877 df-sdom 8878 df-fin 8879 df-pnf 11155 df-mnf 11156 df-xr 11157 df-ltxr 11158 df-le 11159 df-sub 11353 df-neg 11354 df-nn 12133 df-2 12195 df-3 12196 df-4 12197 df-5 12198 df-6 12199 df-n0 12389 df-z 12476 df-uz 12739 df-fz 13410 df-struct 17060 df-sets 17077 df-slot 17095 df-ndx 17107 df-base 17123 df-ress 17144 df-plusg 17176 df-mulr 17177 df-sca 17179 df-vsca 17180 df-0g 17347 df-mre 17490 df-mrc 17491 df-acs 17493 df-proset 18202 df-poset 18221 df-plt 18236 df-lub 18252 df-glb 18253 df-join 18254 df-meet 18255 df-p0 18331 df-p1 18332 df-lat 18340 df-clat 18407 df-mgm 18550 df-sgrp 18629 df-mnd 18645 df-submnd 18694 df-grp 18851 df-minusg 18852 df-sbg 18853 df-subg 19038 df-cntz 19231 df-oppg 19260 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-nzr 20430 df-rlreg 20611 df-domn 20612 df-drng 20648 df-lmod 20797 df-lss 20867 df-lsp 20907 df-lvec 21039 df-lsatoms 39095 df-lshyp 39096 df-lcv 39138 df-lfl 39177 df-lkr 39205 df-ldual 39243 df-oposet 39295 df-ol 39297 df-oml 39298 df-covers 39385 df-ats 39386 df-atl 39417 df-cvlat 39441 df-hlat 39470 df-llines 39617 df-lplanes 39618 df-lvols 39619 df-lines 39620 df-psubsp 39622 df-pmap 39623 df-padd 39915 df-lhyp 40107 df-laut 40108 df-ldil 40223 df-ltrn 40224 df-trl 40278 df-tgrp 40862 df-tendo 40874 df-edring 40876 df-dveca 41122 df-disoa 41148 df-dvech 41198 df-dib 41258 df-dic 41292 df-dih 41348 df-doch 41467 df-djh 41514

This theorem is referenced by: lclkrs2 41659 mapddlssN 41759

W3C validator