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

Theorem mreclatdemoBAD 23000
Description: The closed subspaces of a topology-bearing module form a complete lattice. Demonstration for mreclatBAD 18488. (Contributed by Stefan O'Rear, 31-Jan-2015.) TODO (df-riota 7310 update): This proof uses the old df-clat 18424 and references the required instance of mreclatBAD 18488 as a hypothesis. When mreclatBAD 18488 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 6839 . . . . 5 (TopOpen‘𝑊) ∈ V
21uniex 7681 . . . 4 (TopOpen‘𝑊) ∈ V
3 mremre 17525 . . . 4 ( (TopOpen‘𝑊) ∈ V → (Moore‘ (TopOpen‘𝑊)) ∈ (Moore‘𝒫 (TopOpen‘𝑊)))
42, 3mp1i 13 . . 3 (𝑊 ∈ (TopSp ∩ LMod) → (Moore‘ (TopOpen‘𝑊)) ∈ (Moore‘𝒫 (TopOpen‘𝑊)))
5 elinel2 4155 . . . . 5 (𝑊 ∈ (TopSp ∩ LMod) → 𝑊 ∈ LMod)
6 eqid 2729 . . . . . 6 (Base‘𝑊) = (Base‘𝑊)
7 eqid 2729 . . . . . 6 (LSubSp‘𝑊) = (LSubSp‘𝑊)
86, 7lssmre 20888 . . . . 5 (𝑊 ∈ LMod → (LSubSp‘𝑊) ∈ (Moore‘(Base‘𝑊)))
95, 8syl 17 . . . 4 (𝑊 ∈ (TopSp ∩ LMod) → (LSubSp‘𝑊) ∈ (Moore‘(Base‘𝑊)))
10 elinel1 4154 . . . . 5 (𝑊 ∈ (TopSp ∩ LMod) → 𝑊 ∈ TopSp)
11 eqid 2729 . . . . . . 7 (TopOpen‘𝑊) = (TopOpen‘𝑊)
126, 11tpsuni 22840 . . . . . 6 (𝑊 ∈ TopSp → (Base‘𝑊) = (TopOpen‘𝑊))
1312fveq2d 6830 . . . . 5 (𝑊 ∈ TopSp → (Moore‘(Base‘𝑊)) = (Moore‘ (TopOpen‘𝑊)))
1410, 13syl 17 . . . 4 (𝑊 ∈ (TopSp ∩ LMod) → (Moore‘(Base‘𝑊)) = (Moore‘ (TopOpen‘𝑊)))
159, 14eleqtrd 2830 . . 3 (𝑊 ∈ (TopSp ∩ LMod) → (LSubSp‘𝑊) ∈ (Moore‘ (TopOpen‘𝑊)))
1611tpstop 22841 . . . 4 (𝑊 ∈ TopSp → (TopOpen‘𝑊) ∈ Top)
17 eqid 2729 . . . . 5 (TopOpen‘𝑊) = (TopOpen‘𝑊)
1817cldmre 22982 . . . 4 ((TopOpen‘𝑊) ∈ Top → (Clsd‘(TopOpen‘𝑊)) ∈ (Moore‘ (TopOpen‘𝑊)))
1910, 16, 183syl 18 . . 3 (𝑊 ∈ (TopSp ∩ LMod) → (Clsd‘(TopOpen‘𝑊)) ∈ (Moore‘ (TopOpen‘𝑊)))
20 mreincl 17520 . . 3 (((Moore‘ (TopOpen‘𝑊)) ∈ (Moore‘𝒫 (TopOpen‘𝑊)) ∧ (LSubSp‘𝑊) ∈ (Moore‘ (TopOpen‘𝑊)) ∧ (Clsd‘(TopOpen‘𝑊)) ∈ (Moore‘ (TopOpen‘𝑊))) → ((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊))) ∈ (Moore‘ (TopOpen‘𝑊)))
214, 15, 19, 20syl3anc 1373 . 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 1540  wcel 2109  Vcvv 3438  cin 3904  𝒫 cpw 4553   cuni 4861  cfv 6486  Basecbs 17139  TopOpenctopn 17344  Moorecmre 17503  CLatccla 18423  toInccipo 18452  LModclmod 20782  LSubSpclss 20853  Topctop 22797  TopSpctps 22836  Clsdccld 22920
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7675  ax-cnex 11084  ax-resscn 11085  ax-1cn 11086  ax-icn 11087  ax-addcl 11088  ax-addrcl 11089  ax-mulcl 11090  ax-mulrcl 11091  ax-mulcom 11092  ax-addass 11093  ax-mulass 11094  ax-distr 11095  ax-i2m1 11096  ax-1ne0 11097  ax-1rid 11098  ax-rnegex 11099  ax-rrecex 11100  ax-cnre 11101  ax-pre-lttri 11102  ax-pre-lttrn 11103  ax-pre-ltadd 11104  ax-pre-mulgt0 11105
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3345  df-reu 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-int 4900  df-iun 4946  df-iin 4947  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7310  df-ov 7356  df-oprab 7357  df-mpo 7358  df-om 7807  df-1st 7931  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-er 8632  df-en 8880  df-dom 8881  df-sdom 8882  df-pnf 11170  df-mnf 11171  df-xr 11172  df-ltxr 11173  df-le 11174  df-sub 11368  df-neg 11369  df-nn 12148  df-2 12210  df-sets 17094  df-slot 17112  df-ndx 17124  df-base 17140  df-plusg 17193  df-0g 17364  df-mre 17507  df-mgm 18533  df-sgrp 18612  df-mnd 18628  df-grp 18834  df-minusg 18835  df-sbg 18836  df-mgp 20045  df-ur 20086  df-ring 20139  df-lmod 20784  df-lss 20854  df-top 22798  df-topon 22815  df-topsp 22837  df-cld 22923
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator