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

Theorem clstop 21672
 Description: The closure of a topology's underlying set is the entire set. (Contributed by NM, 5-Oct-2007.) (Proof shortened by Jim Kingdon, 11-Mar-2023.)
Hypothesis
Ref Expression
clscld.1 𝑋 = 𝐽
Assertion
Ref Expression
clstop (𝐽 ∈ Top → ((cls‘𝐽)‘𝑋) = 𝑋)

Proof of Theorem clstop
StepHypRef Expression
1 clscld.1 . . 3 𝑋 = 𝐽
21topcld 21638 . 2 (𝐽 ∈ Top → 𝑋 ∈ (Clsd‘𝐽))
3 cldcls 21645 . 2 (𝑋 ∈ (Clsd‘𝐽) → ((cls‘𝐽)‘𝑋) = 𝑋)
42, 3syl 17 1 (𝐽 ∈ Top → ((cls‘𝐽)‘𝑋) = 𝑋)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   = wceq 1538   ∈ wcel 2114  ∪ cuni 4813  ‘cfv 6334  Topctop 21496  Clsdccld 21619  clsccl 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 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2178  ax-ext 2794  ax-rep 5166  ax-sep 5179  ax-nul 5186  ax-pow 5243  ax-pr 5307  ax-un 7446 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2801  df-cleq 2815  df-clel 2894  df-nfc 2962  df-ne 3012  df-ral 3135  df-rex 3136  df-reu 3137  df-rab 3139  df-v 3471  df-sbc 3748  df-csb 3856  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4266  df-if 4440  df-pw 4513  df-sn 4540  df-pr 4542  df-op 4546  df-uni 4814  df-int 4852  df-iun 4896  df-br 5043  df-opab 5105  df-mpt 5123  df-id 5437  df-xp 5538  df-rel 5539  df-cnv 5540  df-co 5541  df-dm 5542  df-rn 5543  df-res 5544  df-ima 5545  df-iota 6293  df-fun 6336  df-fn 6337  df-f 6338  df-f1 6339  df-fo 6340  df-f1o 6341  df-fv 6342  df-top 21497  df-cld 21622  df-cls 21624 This theorem is referenced by:  hauscmplem  22009
 Copyright terms: Public domain W3C validator