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

Theorem mreclatdemoBAD 21701
Description: The closed subspaces of a topology-bearing module form a complete lattice. Demonstration for mreclatBAD 17789. (Contributed by Stefan O'Rear, 31-Jan-2015.) TODO (df-riota 7093 update): This proof uses the old df-clat 17710 and references the required instance of mreclatBAD 17789 as a hypothesis. When mreclatBAD 17789 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 6658 . . . . 5 (TopOpen‘𝑊) ∈ V
21uniex 7447 . . . 4 (TopOpen‘𝑊) ∈ V
3 mremre 16867 . . . 4 ( (TopOpen‘𝑊) ∈ V → (Moore‘ (TopOpen‘𝑊)) ∈ (Moore‘𝒫 (TopOpen‘𝑊)))
42, 3mp1i 13 . . 3 (𝑊 ∈ (TopSp ∩ LMod) → (Moore‘ (TopOpen‘𝑊)) ∈ (Moore‘𝒫 (TopOpen‘𝑊)))
5 elinel2 4123 . . . . 5 (𝑊 ∈ (TopSp ∩ LMod) → 𝑊 ∈ LMod)
6 eqid 2798 . . . . . 6 (Base‘𝑊) = (Base‘𝑊)
7 eqid 2798 . . . . . 6 (LSubSp‘𝑊) = (LSubSp‘𝑊)
86, 7lssmre 19731 . . . . 5 (𝑊 ∈ LMod → (LSubSp‘𝑊) ∈ (Moore‘(Base‘𝑊)))
95, 8syl 17 . . . 4 (𝑊 ∈ (TopSp ∩ LMod) → (LSubSp‘𝑊) ∈ (Moore‘(Base‘𝑊)))
10 elinel1 4122 . . . . 5 (𝑊 ∈ (TopSp ∩ LMod) → 𝑊 ∈ TopSp)
11 eqid 2798 . . . . . . 7 (TopOpen‘𝑊) = (TopOpen‘𝑊)
126, 11tpsuni 21541 . . . . . 6 (𝑊 ∈ TopSp → (Base‘𝑊) = (TopOpen‘𝑊))
1312fveq2d 6649 . . . . 5 (𝑊 ∈ TopSp → (Moore‘(Base‘𝑊)) = (Moore‘ (TopOpen‘𝑊)))
1410, 13syl 17 . . . 4 (𝑊 ∈ (TopSp ∩ LMod) → (Moore‘(Base‘𝑊)) = (Moore‘ (TopOpen‘𝑊)))
159, 14eleqtrd 2892 . . 3 (𝑊 ∈ (TopSp ∩ LMod) → (LSubSp‘𝑊) ∈ (Moore‘ (TopOpen‘𝑊)))
1611tpstop 21542 . . . 4 (𝑊 ∈ TopSp → (TopOpen‘𝑊) ∈ Top)
17 eqid 2798 . . . . 5 (TopOpen‘𝑊) = (TopOpen‘𝑊)
1817cldmre 21683 . . . 4 ((TopOpen‘𝑊) ∈ Top → (Clsd‘(TopOpen‘𝑊)) ∈ (Moore‘ (TopOpen‘𝑊)))
1910, 16, 183syl 18 . . 3 (𝑊 ∈ (TopSp ∩ LMod) → (Clsd‘(TopOpen‘𝑊)) ∈ (Moore‘ (TopOpen‘𝑊)))
20 mreincl 16862 . . 3 (((Moore‘ (TopOpen‘𝑊)) ∈ (Moore‘𝒫 (TopOpen‘𝑊)) ∧ (LSubSp‘𝑊) ∈ (Moore‘ (TopOpen‘𝑊)) ∧ (Clsd‘(TopOpen‘𝑊)) ∈ (Moore‘ (TopOpen‘𝑊))) → ((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊))) ∈ (Moore‘ (TopOpen‘𝑊)))
214, 15, 19, 20syl3anc 1368 . 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 1538  wcel 2111  Vcvv 3441  cin 3880  𝒫 cpw 4497   cuni 4800  cfv 6324  Basecbs 16475  TopOpenctopn 16687  Moorecmre 16845  CLatccla 17709  toInccipo 17753  LModclmod 19627  LSubSpclss 19696  Topctop 21498  TopSpctps 21537  Clsdccld 21621
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-iin 4884  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-1st 7671  df-2nd 7672  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-er 8272  df-en 8493  df-dom 8494  df-sdom 8495  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-nn 11626  df-2 11688  df-ndx 16478  df-slot 16479  df-base 16481  df-sets 16482  df-plusg 16570  df-0g 16707  df-mre 16849  df-mgm 17844  df-sgrp 17893  df-mnd 17904  df-grp 18098  df-minusg 18099  df-sbg 18100  df-mgp 19233  df-ur 19245  df-ring 19292  df-lmod 19629  df-lss 19697  df-top 21499  df-topon 21516  df-topsp 21538  df-cld 21624
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator