MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mreclatdemoBAD Structured version   Visualization version   GIF version

Theorem mreclatdemoBAD 22155
Description: The closed subspaces of a topology-bearing module form a complete lattice. Demonstration for mreclatBAD 18196. (Contributed by Stefan O'Rear, 31-Jan-2015.) TODO (df-riota 7212 update): This proof uses the old df-clat 18132 and references the required instance of mreclatBAD 18196 as a hypothesis. When mreclatBAD 18196 is corrected to become mreclat, delete this theorem and uncomment the mreclatdemo below.
Hypothesis
Ref Expression
mreclatBAD. (((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊))) ∈ (Moore‘ (TopOpen‘𝑊)) → (toInc‘((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊)))) ∈ CLat)
Assertion
Ref Expression
mreclatdemoBAD (𝑊 ∈ (TopSp ∩ LMod) → (toInc‘((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊)))) ∈ CLat)

Proof of Theorem mreclatdemoBAD
StepHypRef Expression
1 fvex 6769 . . . . 5 (TopOpen‘𝑊) ∈ V
21uniex 7572 . . . 4 (TopOpen‘𝑊) ∈ V
3 mremre 17230 . . . 4 ( (TopOpen‘𝑊) ∈ V → (Moore‘ (TopOpen‘𝑊)) ∈ (Moore‘𝒫 (TopOpen‘𝑊)))
42, 3mp1i 13 . . 3 (𝑊 ∈ (TopSp ∩ LMod) → (Moore‘ (TopOpen‘𝑊)) ∈ (Moore‘𝒫 (TopOpen‘𝑊)))
5 elinel2 4126 . . . . 5 (𝑊 ∈ (TopSp ∩ LMod) → 𝑊 ∈ LMod)
6 eqid 2738 . . . . . 6 (Base‘𝑊) = (Base‘𝑊)
7 eqid 2738 . . . . . 6 (LSubSp‘𝑊) = (LSubSp‘𝑊)
86, 7lssmre 20143 . . . . 5 (𝑊 ∈ LMod → (LSubSp‘𝑊) ∈ (Moore‘(Base‘𝑊)))
95, 8syl 17 . . . 4 (𝑊 ∈ (TopSp ∩ LMod) → (LSubSp‘𝑊) ∈ (Moore‘(Base‘𝑊)))
10 elinel1 4125 . . . . 5 (𝑊 ∈ (TopSp ∩ LMod) → 𝑊 ∈ TopSp)
11 eqid 2738 . . . . . . 7 (TopOpen‘𝑊) = (TopOpen‘𝑊)
126, 11tpsuni 21993 . . . . . 6 (𝑊 ∈ TopSp → (Base‘𝑊) = (TopOpen‘𝑊))
1312fveq2d 6760 . . . . 5 (𝑊 ∈ TopSp → (Moore‘(Base‘𝑊)) = (Moore‘ (TopOpen‘𝑊)))
1410, 13syl 17 . . . 4 (𝑊 ∈ (TopSp ∩ LMod) → (Moore‘(Base‘𝑊)) = (Moore‘ (TopOpen‘𝑊)))
159, 14eleqtrd 2841 . . 3 (𝑊 ∈ (TopSp ∩ LMod) → (LSubSp‘𝑊) ∈ (Moore‘ (TopOpen‘𝑊)))
1611tpstop 21994 . . . 4 (𝑊 ∈ TopSp → (TopOpen‘𝑊) ∈ Top)
17 eqid 2738 . . . . 5 (TopOpen‘𝑊) = (TopOpen‘𝑊)
1817cldmre 22137 . . . 4 ((TopOpen‘𝑊) ∈ Top → (Clsd‘(TopOpen‘𝑊)) ∈ (Moore‘ (TopOpen‘𝑊)))
1910, 16, 183syl 18 . . 3 (𝑊 ∈ (TopSp ∩ LMod) → (Clsd‘(TopOpen‘𝑊)) ∈ (Moore‘ (TopOpen‘𝑊)))
20 mreincl 17225 . . 3 (((Moore‘ (TopOpen‘𝑊)) ∈ (Moore‘𝒫 (TopOpen‘𝑊)) ∧ (LSubSp‘𝑊) ∈ (Moore‘ (TopOpen‘𝑊)) ∧ (Clsd‘(TopOpen‘𝑊)) ∈ (Moore‘ (TopOpen‘𝑊))) → ((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊))) ∈ (Moore‘ (TopOpen‘𝑊)))
214, 15, 19, 20syl3anc 1369 . 2 (𝑊 ∈ (TopSp ∩ LMod) → ((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊))) ∈ (Moore‘ (TopOpen‘𝑊)))
22 mreclatBAD. . 2 (((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊))) ∈ (Moore‘ (TopOpen‘𝑊)) → (toInc‘((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊)))) ∈ CLat)
2321, 22syl 17 1 (𝑊 ∈ (TopSp ∩ LMod) → (toInc‘((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊)))) ∈ CLat)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1539  wcel 2108  Vcvv 3422  cin 3882  𝒫 cpw 4530   cuni 4836  cfv 6418  Basecbs 16840  TopOpenctopn 17049  Moorecmre 17208  CLatccla 18131  toInccipo 18160  LModclmod 20038  LSubSpclss 20108  Topctop 21950  TopSpctps 21989  Clsdccld 22075
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-cnex 10858  ax-resscn 10859  ax-1cn 10860  ax-icn 10861  ax-addcl 10862  ax-addrcl 10863  ax-mulcl 10864  ax-mulrcl 10865  ax-mulcom 10866  ax-addass 10867  ax-mulass 10868  ax-distr 10869  ax-i2m1 10870  ax-1ne0 10871  ax-1rid 10872  ax-rnegex 10873  ax-rrecex 10874  ax-cnre 10875  ax-pre-lttri 10876  ax-pre-lttrn 10877  ax-pre-ltadd 10878  ax-pre-mulgt0 10879
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-nel 3049  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-iin 4924  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-1st 7804  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-er 8456  df-en 8692  df-dom 8693  df-sdom 8694  df-pnf 10942  df-mnf 10943  df-xr 10944  df-ltxr 10945  df-le 10946  df-sub 11137  df-neg 11138  df-nn 11904  df-2 11966  df-sets 16793  df-slot 16811  df-ndx 16823  df-base 16841  df-plusg 16901  df-0g 17069  df-mre 17212  df-mgm 18241  df-sgrp 18290  df-mnd 18301  df-grp 18495  df-minusg 18496  df-sbg 18497  df-mgp 19636  df-ur 19653  df-ring 19700  df-lmod 20040  df-lss 20109  df-top 21951  df-topon 21968  df-topsp 21990  df-cld 22078
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator