![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > mreclatdemoBAD | Structured version Visualization version GIF version |
Description: The closed subspaces of a topology-bearing module form a complete lattice. Demonstration for mreclatBAD 17502. (Contributed by Stefan O'Rear, 31-Jan-2015.) TODO (df-riota 6839 update): This proof uses the old df-clat 17423 and references the required instance of mreclatBAD 17502 as a hypothesis. When mreclatBAD 17502 is corrected to become mreclat, delete this theorem and uncomment the mreclatdemo below. |
Ref | Expression |
---|---|
mreclatBAD. | ⊢ (((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊))) ∈ (Moore‘∪ (TopOpen‘𝑊)) → (toInc‘((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊)))) ∈ CLat) |
Ref | Expression |
---|---|
mreclatdemoBAD | ⊢ (𝑊 ∈ (TopSp ∩ LMod) → (toInc‘((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊)))) ∈ CLat) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fvex 6424 | . . . . 5 ⊢ (TopOpen‘𝑊) ∈ V | |
2 | 1 | uniex 7187 | . . . 4 ⊢ ∪ (TopOpen‘𝑊) ∈ V |
3 | mremre 16579 | . . . 4 ⊢ (∪ (TopOpen‘𝑊) ∈ V → (Moore‘∪ (TopOpen‘𝑊)) ∈ (Moore‘𝒫 ∪ (TopOpen‘𝑊))) | |
4 | 2, 3 | mp1i 13 | . . 3 ⊢ (𝑊 ∈ (TopSp ∩ LMod) → (Moore‘∪ (TopOpen‘𝑊)) ∈ (Moore‘𝒫 ∪ (TopOpen‘𝑊))) |
5 | inss2 4029 | . . . . . 6 ⊢ (TopSp ∩ LMod) ⊆ LMod | |
6 | 5 | sseli 3794 | . . . . 5 ⊢ (𝑊 ∈ (TopSp ∩ LMod) → 𝑊 ∈ LMod) |
7 | eqid 2799 | . . . . . 6 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
8 | eqid 2799 | . . . . . 6 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊) | |
9 | 7, 8 | lssmre 19287 | . . . . 5 ⊢ (𝑊 ∈ LMod → (LSubSp‘𝑊) ∈ (Moore‘(Base‘𝑊))) |
10 | 6, 9 | syl 17 | . . . 4 ⊢ (𝑊 ∈ (TopSp ∩ LMod) → (LSubSp‘𝑊) ∈ (Moore‘(Base‘𝑊))) |
11 | inss1 4028 | . . . . . 6 ⊢ (TopSp ∩ LMod) ⊆ TopSp | |
12 | 11 | sseli 3794 | . . . . 5 ⊢ (𝑊 ∈ (TopSp ∩ LMod) → 𝑊 ∈ TopSp) |
13 | eqid 2799 | . . . . . . 7 ⊢ (TopOpen‘𝑊) = (TopOpen‘𝑊) | |
14 | 7, 13 | tpsuni 21069 | . . . . . 6 ⊢ (𝑊 ∈ TopSp → (Base‘𝑊) = ∪ (TopOpen‘𝑊)) |
15 | 14 | fveq2d 6415 | . . . . 5 ⊢ (𝑊 ∈ TopSp → (Moore‘(Base‘𝑊)) = (Moore‘∪ (TopOpen‘𝑊))) |
16 | 12, 15 | syl 17 | . . . 4 ⊢ (𝑊 ∈ (TopSp ∩ LMod) → (Moore‘(Base‘𝑊)) = (Moore‘∪ (TopOpen‘𝑊))) |
17 | 10, 16 | eleqtrd 2880 | . . 3 ⊢ (𝑊 ∈ (TopSp ∩ LMod) → (LSubSp‘𝑊) ∈ (Moore‘∪ (TopOpen‘𝑊))) |
18 | 13 | tpstop 21070 | . . . 4 ⊢ (𝑊 ∈ TopSp → (TopOpen‘𝑊) ∈ Top) |
19 | eqid 2799 | . . . . 5 ⊢ ∪ (TopOpen‘𝑊) = ∪ (TopOpen‘𝑊) | |
20 | 19 | cldmre 21211 | . . . 4 ⊢ ((TopOpen‘𝑊) ∈ Top → (Clsd‘(TopOpen‘𝑊)) ∈ (Moore‘∪ (TopOpen‘𝑊))) |
21 | 12, 18, 20 | 3syl 18 | . . 3 ⊢ (𝑊 ∈ (TopSp ∩ LMod) → (Clsd‘(TopOpen‘𝑊)) ∈ (Moore‘∪ (TopOpen‘𝑊))) |
22 | mreincl 16574 | . . 3 ⊢ (((Moore‘∪ (TopOpen‘𝑊)) ∈ (Moore‘𝒫 ∪ (TopOpen‘𝑊)) ∧ (LSubSp‘𝑊) ∈ (Moore‘∪ (TopOpen‘𝑊)) ∧ (Clsd‘(TopOpen‘𝑊)) ∈ (Moore‘∪ (TopOpen‘𝑊))) → ((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊))) ∈ (Moore‘∪ (TopOpen‘𝑊))) | |
23 | 4, 17, 21, 22 | syl3anc 1491 | . 2 ⊢ (𝑊 ∈ (TopSp ∩ LMod) → ((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊))) ∈ (Moore‘∪ (TopOpen‘𝑊))) |
24 | mreclatBAD. | . 2 ⊢ (((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊))) ∈ (Moore‘∪ (TopOpen‘𝑊)) → (toInc‘((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊)))) ∈ CLat) | |
25 | 23, 24 | syl 17 | 1 ⊢ (𝑊 ∈ (TopSp ∩ LMod) → (toInc‘((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊)))) ∈ CLat) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1653 ∈ wcel 2157 Vcvv 3385 ∩ cin 3768 𝒫 cpw 4349 ∪ cuni 4628 ‘cfv 6101 Basecbs 16184 TopOpenctopn 16397 Moorecmre 16557 CLatccla 17422 toInccipo 17466 LModclmod 19181 LSubSpclss 19250 Topctop 21026 TopSpctps 21065 Clsdccld 21149 |
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-cnex 10280 ax-resscn 10281 ax-1cn 10282 ax-icn 10283 ax-addcl 10284 ax-addrcl 10285 ax-mulcl 10286 ax-mulrcl 10287 ax-mulcom 10288 ax-addass 10289 ax-mulass 10290 ax-distr 10291 ax-i2m1 10292 ax-1ne0 10293 ax-1rid 10294 ax-rnegex 10295 ax-rrecex 10296 ax-cnre 10297 ax-pre-lttri 10298 ax-pre-lttrn 10299 ax-pre-ltadd 10300 ax-pre-mulgt0 10301 |
This theorem depends on definitions: df-bi 199 df-an 386 df-or 875 df-3or 1109 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-pss 3785 df-nul 4116 df-if 4278 df-pw 4351 df-sn 4369 df-pr 4371 df-tp 4373 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-tr 4946 df-id 5220 df-eprel 5225 df-po 5233 df-so 5234 df-fr 5271 df-we 5273 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-pred 5898 df-ord 5944 df-on 5945 df-lim 5946 df-suc 5947 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-mpt2 6883 df-om 7300 df-1st 7401 df-2nd 7402 df-wrecs 7645 df-recs 7707 df-rdg 7745 df-er 7982 df-en 8196 df-dom 8197 df-sdom 8198 df-pnf 10365 df-mnf 10366 df-xr 10367 df-ltxr 10368 df-le 10369 df-sub 10558 df-neg 10559 df-nn 11313 df-2 11376 df-ndx 16187 df-slot 16188 df-base 16190 df-sets 16191 df-plusg 16280 df-0g 16417 df-mre 16561 df-mgm 17557 df-sgrp 17599 df-mnd 17610 df-grp 17741 df-minusg 17742 df-sbg 17743 df-mgp 18806 df-ur 18818 df-ring 18865 df-lmod 19183 df-lss 19251 df-top 21027 df-topon 21044 df-topsp 21066 df-cld 21152 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |