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 42862

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 42856 proof. Do we achieve overall shortening by breaking them out as subtheorems? Or make lclkr 42856 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 4008	. . . 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 2763	. . . 4 ⊢ (Base‘𝐷) = (Base‘𝐷)
8		lclkrs.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
9		lclkrs.u	. . . . 5 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
10		lclkrs.k	. . . . 5 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
11	8, 9, 10	dvhlmod 42433	. . . 4 ⊢ (𝜑 → 𝑈 ∈ LMod)
12	5, 6, 7, 11	ldualvbase 40449	. . 3 ⊢ (𝜑 → (Base‘𝐷) = 𝐹)
13	2, 4, 12	3sstr4d 3968	. 2 ⊢ (𝜑 → 𝐶 ⊆ (Base‘𝐷))
14		eqid 2763	. . . . . 6 ⊢ (Scalar‘𝑈) = (Scalar‘𝑈)
15		eqid 2763	. . . . . 6 ⊢ (0_g‘(Scalar‘𝑈)) = (0_g‘(Scalar‘𝑈))
16		eqid 2763	. . . . . 6 ⊢ (Base‘𝑈) = (Base‘𝑈)
17	14, 15, 16, 5	lfl0f 40392	. . . . 5 ⊢ (𝑈 ∈ LMod → ((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}) ∈ 𝐹)
18	11, 17	syl 18	. . . 4 ⊢ (𝜑 → ((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}) ∈ 𝐹)
19		lclkrs.o	. . . . . 6 ⊢ ⊥ = ((ocH‘𝐾)‘𝑊)
20	8, 9, 19, 16, 10	dochoc1 42684	. . . . 5 ⊢ (𝜑 → ( ⊥ ‘( ⊥ ‘(Base‘𝑈))) = (Base‘𝑈))
21		eqidd 2764	. . . . . . . 8 ⊢ (𝜑 → ((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}) = ((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}))
22		lclkrs.l	. . . . . . . . . 10 ⊢ 𝐿 = (LKer‘𝑈)
23	14, 15, 16, 5, 22	lkr0f 40417	. . . . . . . . 9 ⊢ ((𝑈 ∈ LMod ∧ ((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}) ∈ 𝐹) → ((𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))})) = (Base‘𝑈) ↔ ((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}) = ((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))})))
24	11, 18, 23	syl2anc 596	. . . . . . . 8 ⊢ (𝜑 → ((𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))})) = (Base‘𝑈) ↔ ((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}) = ((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))})))
25	21, 24	mpbird 260	. . . . . . 7 ⊢ (𝜑 → (𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))})) = (Base‘𝑈))
26	25	fveq2d 6920	. . . . . 6 ⊢ (𝜑 → ( ⊥ ‘(𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}))) = ( ⊥ ‘(Base‘𝑈)))
27	26	fveq2d 6920	. . . . 5 ⊢ (𝜑 → ( ⊥ ‘( ⊥ ‘(𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))})))) = ( ⊥ ‘( ⊥ ‘(Base‘𝑈))))
28	20, 27, 25	3eqtr4d 2808	. . . 4 ⊢ (𝜑 → ( ⊥ ‘( ⊥ ‘(𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))})))) = (𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))})))
29		eqid 2763	. . . . . . . 8 ⊢ (0_g‘𝑈) = (0_g‘𝑈)
30	8, 9, 19, 16, 29	doch1 42682	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ( ⊥ ‘(Base‘𝑈)) = {(0_g‘𝑈)})
31	10, 30	syl 18	. . . . . 6 ⊢ (𝜑 → ( ⊥ ‘(Base‘𝑈)) = {(0_g‘𝑈)})
32	26, 31	eqtrd 2798	. . . . 5 ⊢ (𝜑 → ( ⊥ ‘(𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}))) = {(0_g‘𝑈)})
33		lclkrs.r	. . . . . 6 ⊢ (𝜑 → 𝑅 ∈ 𝑆)
34		lclkrs.s	. . . . . . 7 ⊢ 𝑆 = (LSubSp‘𝑈)
35	29, 34	lss0ss 21275	. . . . . 6 ⊢ ((𝑈 ∈ LMod ∧ 𝑅 ∈ 𝑆) → {(0_g‘𝑈)} ⊆ 𝑅)
36	11, 33, 35	syl2anc 596	. . . . 5 ⊢ (𝜑 → {(0_g‘𝑈)} ⊆ 𝑅)
37	32, 36	eqsstrd 3947	. . . 4 ⊢ (𝜑 → ( ⊥ ‘(𝐿‘((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}))) ⊆ 𝑅)
38	3	lcfls1lem 42857	. . . 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 1362	. . 3 ⊢ (𝜑 → ((Base‘𝑈) × {(0_g‘(Scalar‘𝑈))}) ∈ 𝐶)
40	39	ne0d 4291	. 2 ⊢ (𝜑 → 𝐶 ≠ ∅)
41		eqid 2763	. . . 4 ⊢ (Base‘(Scalar‘𝑈)) = (Base‘(Scalar‘𝑈))
42		eqid 2763	. . . 4 ⊢ ( ·_𝑠 ‘𝐷) = ( ·_𝑠 ‘𝐷)
43	10	adantr 486	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
44	33	adantr 486	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → 𝑅 ∈ 𝑆)
45		simpr3 1215	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → 𝑏 ∈ 𝐶)
46		eqid 2763	. . . 4 ⊢ (+_g‘𝐷) = (+_g‘𝐷)
47		simpr2 1214	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → 𝑎 ∈ 𝐶)
48		simpr1 1213	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → 𝑥 ∈ (Base‘(Scalar‘𝐷)))
49		eqid 2763	. . . . . . . 8 ⊢ (Scalar‘𝐷) = (Scalar‘𝐷)
50		eqid 2763	. . . . . . . 8 ⊢ (Base‘(Scalar‘𝐷)) = (Base‘(Scalar‘𝐷))
51	14, 41, 6, 49, 50, 11	ldualsbase 40456	. . . . . . 7 ⊢ (𝜑 → (Base‘(Scalar‘𝐷)) = (Base‘(Scalar‘𝑈)))
52	51	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → (Base‘(Scalar‘𝐷)) = (Base‘(Scalar‘𝑈)))
53	48, 52	eleqtrd 2866	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → 𝑥 ∈ (Base‘(Scalar‘𝑈)))
54	8, 19, 9, 34, 5, 22, 6, 14, 41, 42, 3, 43, 44, 47, 53	lclkrslem1 42860	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → (𝑥( ·_𝑠 ‘𝐷)𝑎) ∈ 𝐶)
55	8, 19, 9, 34, 5, 22, 6, 14, 41, 42, 3, 43, 44, 45, 46, 54	lclkrslem2 42861	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐷)) ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐶)) → ((𝑥( ·_𝑠 ‘𝐷)𝑎)(+_g‘𝐷)𝑏) ∈ 𝐶)
56	55	ralrimivvva 3212	. 2 ⊢ (𝜑 → ∀𝑥 ∈ (Base‘(Scalar‘𝐷))∀𝑎 ∈ 𝐶 ∀𝑏 ∈ 𝐶 ((𝑥( ·_𝑠 ‘𝐷)𝑎)(+_g‘𝐷)𝑏) ∈ 𝐶)
57		lclkrs.t	. . 3 ⊢ 𝑇 = (LSubSp‘𝐷)
58	49, 50, 7, 46, 42, 57	islss 21260	. 2 ⊢ (𝐶 ∈ 𝑇 ↔ (𝐶 ⊆ (Base‘𝐷) ∧ 𝐶 ≠ ∅ ∧ ∀𝑥 ∈ (Base‘(Scalar‘𝐷))∀𝑎 ∈ 𝐶 ∀𝑏 ∈ 𝐶 ((𝑥( ·_𝑠 ‘𝐷)𝑎)(+_g‘𝐷)𝑏) ∈ 𝐶))
59	13, 40, 56, 58	syl3anbrc 1362	1 ⊢ (𝜑 → 𝐶 ∈ 𝑇)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∀wral 3080 {crab 3416 ⊆ wss 3900 ∅c0 4281 {csn 4588 × cxp 5656 ‘cfv 6566 (class class class)co 7451 Basecbs 17431 +_gcplusg 17472 Scalarcsca 17475 ·_𝑠 cvsca 17476 0_gc0g 17660 LModclmod 21186 LSubSpclss 21257 LFnlclfn 40380 LKerclk 40408 LDualcld 40446 HLchlt 40673 LHypclh 41307 DVecHcdvh 42401 ocHcoch 42670

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-riotaBAD 40276

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-iin 4959 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-of 7725 df-om 7912 df-1st 8035 df-2nd 8036 df-tpos 8281 df-undef 8328 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-2o 8515 df-er 8755 df-map 8887 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-3 12446 df-4 12447 df-5 12448 df-6 12449 df-n0 12647 df-z 12734 df-uz 13006 df-fz 13680 df-struct 17369 df-sets 17386 df-slot 17404 df-ndx 17416 df-base 17432 df-ress 17453 df-plusg 17486 df-mulr 17487 df-sca 17489 df-vsca 17490 df-0g 17662 df-mre 17806 df-mrc 17807 df-acs 17809 df-proset 18518 df-poset 18537 df-plt 18552 df-lub 18568 df-glb 18569 df-join 18570 df-meet 18571 df-p0 18647 df-p1 18648 df-lat 18656 df-clat 18723 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-submnd 19029 df-grp 19197 df-minusg 19198 df-sbg 19199 df-subg 19383 df-cntz 19582 df-oppg 19611 df-lsm 19901 df-cmn 20047 df-abl 20048 df-mgp 20412 df-rng 20426 df-ur 20459 df-ring 20512 df-oppr 20618 df-dvdsr 20638 df-unit 20639 df-invr 20669 df-dvr 20682 df-nzr 20814 df-rlreg 20997 df-domn 20998 df-drng 21033 df-lmod 21188 df-lss 21258 df-lsp 21298 df-lvec 21429 df-lsatoms 40299 df-lshyp 40300 df-lcv 40342 df-lfl 40381 df-lkr 40409 df-ldual 40447 df-oposet 40499 df-ol 40501 df-oml 40502 df-covers 40589 df-ats 40590 df-atl 40621 df-cvlat 40645 df-hlat 40674 df-llines 40821 df-lplanes 40822 df-lvols 40823 df-lines 40824 df-psubsp 40826 df-pmap 40827 df-padd 41119 df-lhyp 41311 df-laut 41312 df-ldil 41427 df-ltrn 41428 df-trl 41482 df-tgrp 42066 df-tendo 42078 df-edring 42080 df-dveca 42326 df-disoa 42352 df-dvech 42402 df-dib 42462 df-dic 42496 df-dih 42552 df-doch 42671 df-djh 42718

This theorem is used by: lclkrs2 42863 mapddlssN 42963

W3C validator