![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > pclss2polN | Structured version Visualization version GIF version |
Description: The projective subspace closure is a subset of closed subspace closure. (Contributed by NM, 12-Sep-2013.) (New usage is discouraged.) |
Ref | Expression |
---|---|
pclss2pol.a | ⊢ 𝐴 = (Atoms‘𝐾) |
pclss2pol.o | ⊢ ⊥ = (⊥𝑃‘𝐾) |
pclss2pol.c | ⊢ 𝑈 = (PCl‘𝐾) |
Ref | Expression |
---|---|
pclss2polN | ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → (𝑈‘𝑋) ⊆ ( ⊥ ‘( ⊥ ‘𝑋))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 475 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → 𝐾 ∈ HL) | |
2 | pclss2pol.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
3 | pclss2pol.o | . . . 4 ⊢ ⊥ = (⊥𝑃‘𝐾) | |
4 | 2, 3 | 2polssN 35936 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → 𝑋 ⊆ ( ⊥ ‘( ⊥ ‘𝑋))) |
5 | 2, 3 | polssatN 35929 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ( ⊥ ‘𝑋) ⊆ 𝐴) |
6 | 2, 3 | polssatN 35929 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ ( ⊥ ‘𝑋) ⊆ 𝐴) → ( ⊥ ‘( ⊥ ‘𝑋)) ⊆ 𝐴) |
7 | 5, 6 | syldan 586 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ( ⊥ ‘( ⊥ ‘𝑋)) ⊆ 𝐴) |
8 | pclss2pol.c | . . . 4 ⊢ 𝑈 = (PCl‘𝐾) | |
9 | 2, 8 | pclssN 35915 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ ( ⊥ ‘( ⊥ ‘𝑋)) ∧ ( ⊥ ‘( ⊥ ‘𝑋)) ⊆ 𝐴) → (𝑈‘𝑋) ⊆ (𝑈‘( ⊥ ‘( ⊥ ‘𝑋)))) |
10 | 1, 4, 7, 9 | syl3anc 1491 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → (𝑈‘𝑋) ⊆ (𝑈‘( ⊥ ‘( ⊥ ‘𝑋)))) |
11 | eqid 2799 | . . . . 5 ⊢ (PSubSp‘𝐾) = (PSubSp‘𝐾) | |
12 | 2, 11, 3 | polsubN 35928 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ ( ⊥ ‘𝑋) ⊆ 𝐴) → ( ⊥ ‘( ⊥ ‘𝑋)) ∈ (PSubSp‘𝐾)) |
13 | 5, 12 | syldan 586 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ( ⊥ ‘( ⊥ ‘𝑋)) ∈ (PSubSp‘𝐾)) |
14 | 11, 8 | pclidN 35917 | . . 3 ⊢ ((𝐾 ∈ HL ∧ ( ⊥ ‘( ⊥ ‘𝑋)) ∈ (PSubSp‘𝐾)) → (𝑈‘( ⊥ ‘( ⊥ ‘𝑋))) = ( ⊥ ‘( ⊥ ‘𝑋))) |
15 | 13, 14 | syldan 586 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → (𝑈‘( ⊥ ‘( ⊥ ‘𝑋))) = ( ⊥ ‘( ⊥ ‘𝑋))) |
16 | 10, 15 | sseqtrd 3837 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → (𝑈‘𝑋) ⊆ ( ⊥ ‘( ⊥ ‘𝑋))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 385 = wceq 1653 ∈ wcel 2157 ⊆ wss 3769 ‘cfv 6101 Atomscatm 35284 HLchlt 35371 PSubSpcpsubsp 35517 PClcpclN 35908 ⊥𝑃cpolN 35923 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1891 ax-4 1905 ax-5 2006 ax-6 2072 ax-7 2107 ax-8 2159 ax-9 2166 ax-10 2185 ax-11 2200 ax-12 2213 ax-13 2377 ax-ext 2777 ax-rep 4964 ax-sep 4975 ax-nul 4983 ax-pow 5035 ax-pr 5097 ax-un 7183 ax-riotaBAD 34974 |
This theorem depends on definitions: df-bi 199 df-an 386 df-or 875 df-3an 1110 df-tru 1657 df-ex 1876 df-nf 1880 df-sb 2065 df-mo 2591 df-eu 2609 df-clab 2786 df-cleq 2792 df-clel 2795 df-nfc 2930 df-ne 2972 df-nel 3075 df-ral 3094 df-rex 3095 df-reu 3096 df-rmo 3097 df-rab 3098 df-v 3387 df-sbc 3634 df-csb 3729 df-dif 3772 df-un 3774 df-in 3776 df-ss 3783 df-nul 4116 df-if 4278 df-pw 4351 df-sn 4369 df-pr 4371 df-op 4375 df-uni 4629 df-int 4668 df-iun 4712 df-iin 4713 df-br 4844 df-opab 4906 df-mpt 4923 df-id 5220 df-xp 5318 df-rel 5319 df-cnv 5320 df-co 5321 df-dm 5322 df-rn 5323 df-res 5324 df-ima 5325 df-iota 6064 df-fun 6103 df-fn 6104 df-f 6105 df-f1 6106 df-fo 6107 df-f1o 6108 df-fv 6109 df-riota 6839 df-ov 6881 df-oprab 6882 df-undef 7637 df-proset 17243 df-poset 17261 df-plt 17273 df-lub 17289 df-glb 17290 df-join 17291 df-meet 17292 df-p0 17354 df-p1 17355 df-lat 17361 df-clat 17423 df-oposet 35197 df-ol 35199 df-oml 35200 df-covers 35287 df-ats 35288 df-atl 35319 df-cvlat 35343 df-hlat 35372 df-psubsp 35524 df-pmap 35525 df-pclN 35909 df-polarityN 35924 |
This theorem is referenced by: pcl0N 35943 |
Copyright terms: Public domain | W3C validator |