polsubclN - Mathbox for Norm Megill

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

Theorem polsubclN 39970

Description: A polarity is a closed projective subspace. (Contributed by NM, 24-Jan-2012.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
polsubcl.a	⊢ 𝐴 = (Atoms‘𝐾)
polsubcl.p	⊢ ⊥ = (⊥_𝑃‘𝐾)
polsubcl.c	⊢ 𝐶 = (PSubCl‘𝐾)

**Assertion**
Ref	Expression
polsubclN	⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ( ⊥ ‘𝑋) ∈ 𝐶)

**Proof of Theorem polsubclN**
Step	Hyp	Ref	Expression
1		eqid 2730	. . 3 ⊢ (lub‘𝐾) = (lub‘𝐾)
2		eqid 2730	. . 3 ⊢ (oc‘𝐾) = (oc‘𝐾)
3		polsubcl.a	. . 3 ⊢ 𝐴 = (Atoms‘𝐾)
4		eqid 2730	. . 3 ⊢ (pmap‘𝐾) = (pmap‘𝐾)
5		polsubcl.p	. . 3 ⊢ ⊥ = (⊥_𝑃‘𝐾)
6	1, 2, 3, 4, 5	polval2N 39924	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ( ⊥ ‘𝑋) = ((pmap‘𝐾)‘((oc‘𝐾)‘((lub‘𝐾)‘𝑋))))
7		hlop 39380	. . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ OP)
8	7	adantr 480	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → 𝐾 ∈ OP)
9		hlclat 39376	. . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ CLat)
10		eqid 2730	. . . . . . 7 ⊢ (Base‘𝐾) = (Base‘𝐾)
11	10, 3	atssbase 39308	. . . . . 6 ⊢ 𝐴 ⊆ (Base‘𝐾)
12		sstr 3941	. . . . . 6 ⊢ ((𝑋 ⊆ 𝐴 ∧ 𝐴 ⊆ (Base‘𝐾)) → 𝑋 ⊆ (Base‘𝐾))
13	11, 12	mpan2 691	. . . . 5 ⊢ (𝑋 ⊆ 𝐴 → 𝑋 ⊆ (Base‘𝐾))
14	10, 1	clatlubcl 18401	. . . . 5 ⊢ ((𝐾 ∈ CLat ∧ 𝑋 ⊆ (Base‘𝐾)) → ((lub‘𝐾)‘𝑋) ∈ (Base‘𝐾))
15	9, 13, 14	syl2an 596	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ((lub‘𝐾)‘𝑋) ∈ (Base‘𝐾))
16	10, 2	opoccl 39212	. . . 4 ⊢ ((𝐾 ∈ OP ∧ ((lub‘𝐾)‘𝑋) ∈ (Base‘𝐾)) → ((oc‘𝐾)‘((lub‘𝐾)‘𝑋)) ∈ (Base‘𝐾))
17	8, 15, 16	syl2anc 584	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ((oc‘𝐾)‘((lub‘𝐾)‘𝑋)) ∈ (Base‘𝐾))
18		polsubcl.c	. . . 4 ⊢ 𝐶 = (PSubCl‘𝐾)
19	10, 4, 18	pmapsubclN 39964	. . 3 ⊢ ((𝐾 ∈ HL ∧ ((oc‘𝐾)‘((lub‘𝐾)‘𝑋)) ∈ (Base‘𝐾)) → ((pmap‘𝐾)‘((oc‘𝐾)‘((lub‘𝐾)‘𝑋))) ∈ 𝐶)
20	17, 19	syldan 591	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ((pmap‘𝐾)‘((oc‘𝐾)‘((lub‘𝐾)‘𝑋))) ∈ 𝐶)
21	6, 20	eqeltrd 2829	1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ( ⊥ ‘𝑋) ∈ 𝐶)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2110 ⊆ wss 3900 ‘cfv 6477 Basecbs 17112 occoc 17161 lubclub 18207 CLatccla 18396 OPcops 39190 Atomscatm 39281 HLchlt 39368 pmapcpmap 39515 ⊥_𝑃cpolN 39920 PSubClcpscN 39952

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 2112 ax-9 2120 ax-10 2143 ax-11 2159 ax-12 2179 ax-ext 2702 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7663

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-rmo 3344 df-reu 3345 df-rab 3394 df-v 3436 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-nul 4282 df-if 4474 df-pw 4550 df-sn 4575 df-pr 4577 df-op 4581 df-uni 4858 df-iun 4941 df-iin 4942 df-br 5090 df-opab 5152 df-mpt 5171 df-id 5509 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-iota 6433 df-fun 6479 df-fn 6480 df-f 6481 df-f1 6482 df-fo 6483 df-f1o 6484 df-fv 6485 df-riota 7298 df-ov 7344 df-oprab 7345 df-proset 18192 df-poset 18211 df-plt 18226 df-lub 18242 df-glb 18243 df-join 18244 df-meet 18245 df-p0 18321 df-p1 18322 df-lat 18330 df-clat 18397 df-oposet 39194 df-ol 39196 df-oml 39197 df-covers 39284 df-ats 39285 df-atl 39316 df-cvlat 39340 df-hlat 39369 df-pmap 39522 df-polarityN 39921 df-psubclN 39953

This theorem is referenced by: osumcllem9N 39982 pexmidN 39987

W3C validator