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

Theorem mreclatdemoBAD 23426
Description: The closed subspaces of a topology-bearing module form a complete lattice. Demonstration for mreclatBAD 18749. (Contributed by Stefan O'Rear, 31-Jan-2015.) TODO (df-riota 7384 update): This proof uses the old df-clat 18685 and references the required instance of mreclatBAD 18749 as a hypothesis. When mreclatBAD 18749 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 6906 . . . . 5 (TopOpen‘𝑊) ∈ V
21uniex 7765 . . . 4 ∪ (TopOpen‘𝑊) ∈ V
3 mremre 17786 . . . 4 (∪ (TopOpen‘𝑊) ∈ V → (Moore‘∪ (TopOpen‘𝑊)) ∈ (Moore‘𝒫 ∪ (TopOpen‘𝑊)))
42, 3mp1i 14 . . 3 (𝑊 ∈ (TopSp ∩ LMod) → (Moore‘∪ (TopOpen‘𝑊)) ∈ (Moore‘𝒫 ∪ (TopOpen‘𝑊)))
5 elinel2 4101 . . . . 5 (𝑊 ∈ (TopSp ∩ LMod) → 𝑊 ∈ LMod)
6 eqid 2763 . . . . . 6 (Base‘𝑊) = (Base‘𝑊)
7 eqid 2763 . . . . . 6 (LSubSp‘𝑊) = (LSubSp‘𝑊)
86, 7lssmre 21253 . . . . 5 (𝑊 ∈ LMod → (LSubSp‘𝑊) ∈ (Moore‘(Base‘𝑊)))
95, 8syl 18 . . . 4 (𝑊 ∈ (TopSp ∩ LMod) → (LSubSp‘𝑊) ∈ (Moore‘(Base‘𝑊)))
10 elinel1 4100 . . . . 5 (𝑊 ∈ (TopSp ∩ LMod) → 𝑊 ∈ TopSp)
11 eqid 2763 . . . . . . 7 (TopOpen‘𝑊) = (TopOpen‘𝑊)
126, 11tpsuni 23266 . . . . . 6 (𝑊 ∈ TopSp → (Base‘𝑊) = ∪ (TopOpen‘𝑊))
1312fveq2d 6897 . . . . 5 (𝑊 ∈ TopSp → (Moore‘(Base‘𝑊)) = (Moore‘∪ (TopOpen‘𝑊)))
1410, 13syl 18 . . . 4 (𝑊 ∈ (TopSp ∩ LMod) → (Moore‘(Base‘𝑊)) = (Moore‘∪ (TopOpen‘𝑊)))
159, 14eleqtrd 2865 . . 3 (𝑊 ∈ (TopSp ∩ LMod) → (LSubSp‘𝑊) ∈ (Moore‘∪ (TopOpen‘𝑊)))
1611tpstop 23267 . . . 4 (𝑊 ∈ TopSp → (TopOpen‘𝑊) ∈ Top)
17 eqid 2763 . . . . 5 ∪ (TopOpen‘𝑊) = ∪ (TopOpen‘𝑊)
1817cldmre 23408 . . . 4 ((TopOpen‘𝑊) ∈ Top → (Clsd‘(TopOpen‘𝑊)) ∈ (Moore‘∪ (TopOpen‘𝑊)))
1910, 16, 183syl 19 . . 3 (𝑊 ∈ (TopSp ∩ LMod) → (Clsd‘(TopOpen‘𝑊)) ∈ (Moore‘∪ (TopOpen‘𝑊)))
20 mreincl 17781 . . 3 (((Moore‘∪ (TopOpen‘𝑊)) ∈ (Moore‘𝒫 ∪ (TopOpen‘𝑊)) ∧ (LSubSp‘𝑊) ∈ (Moore‘∪ (TopOpen‘𝑊)) ∧ (Clsd‘(TopOpen‘𝑊)) ∈ (Moore‘∪ (TopOpen‘𝑊))) → ((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊))) ∈ (Moore‘∪ (TopOpen‘𝑊)))
214, 15, 19, 20syl3anc 1398 . 2 (𝑊 ∈ (TopSp ∩ LMod) → ((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊))) ∈ (Moore‘∪ (TopOpen‘𝑊)))
22 mreclatBAD. . 2 (((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊))) ∈ (Moore‘∪ (TopOpen‘𝑊)) → (toInc‘((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊)))) ∈ CLat)
2321, 22syl 18 1 (𝑊 ∈ (TopSp ∩ LMod) → (toInc‘((LSubSp‘𝑊) ∩ (Clsd‘(TopOpen‘𝑊)))) ∈ CLat)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2146  Vcvv 3453   ∩ cin 4091  𝒫 cpw 4559  ∪ cuni 4869  ‘cfv 6546  Basecbs 17399  TopOpenctopn 17604  Moorecmre 17764  CLatccla 18684  toInccipo 18713  LModclmod 21147  LSubSpclss 21218  Topctop 23223  TopSpctps 23262  Clsdccld 23346
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758  ax-cnex 11266  ax-resscn 11267  ax-1cn 11268  ax-icn 11269  ax-addcl 11270  ax-addrcl 11271  ax-mulcl 11272  ax-mulrcl 11273  ax-mulcom 11274  ax-addass 11275  ax-mulass 11276  ax-distr 11277  ax-i2m1 11278  ax-1ne0 11279  ax-1rid 11280  ax-rnegex 11281  ax-rrecex 11282  ax-cnre 11283  ax-pre-lttri 11284  ax-pre-lttrn 11285  ax-pre-ltadd 11286  ax-pre-mulgt0 11287
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-int 4910  df-iun 4955  df-iin 4956  df-br 5106  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5549  df-eprel 5554  df-po 5562  df-so 5563  df-fr 5607  df-we 5609  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6310  df-ord 6371  df-on 6372  df-lim 6373  df-suc 6374  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-f1 6551  df-fo 6552  df-f1o 6553  df-fv 6554  df-riota 7384  df-ov 7430  df-oprab 7431  df-mpo 7432  df-om 7885  df-1st 8008  df-2nd 8009  df-frecs 8310  df-wrecs 8341  df-recs 8390  df-rdg 8429  df-er 8728  df-en 8985  df-dom 8986  df-sdom 8987  df-pnf 11355  df-mnf 11356  df-xr 11357  df-ltxr 11358  df-le 11359  df-sub 11553  df-neg 11554  df-nn 12346  df-2 12415  df-sets 17354  df-slot 17372  df-ndx 17384  df-base 17400  df-plusg 17453  df-0g 17624  df-mre 17768  df-mgm 18828  df-sgrp 18920  df-mnd 18936  df-grp 19159  df-minusg 19160  df-sbg 19161  df-mgp 20373  df-ur 20420  df-ring 20473  df-lmod 21149  df-lss 21219  df-top 23224  df-topon 23241  df-topsp 23263  df-cld 23349
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator