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

Theorem clscld 22991
Description: The closure of a subset of a topology's underlying set is closed. (Contributed by NM, 4-Oct-2006.)
Hypothesis
Ref Expression
clscld.1 𝑋 = 𝐽
Assertion
Ref Expression
clscld ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ∈ (Clsd‘𝐽))

Proof of Theorem clscld
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 clscld.1 . . 3 𝑋 = 𝐽
21clsval 22981 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) = {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥})
31topcld 22979 . . . . . 6 (𝐽 ∈ Top → 𝑋 ∈ (Clsd‘𝐽))
43anim1i 615 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑋 ∈ (Clsd‘𝐽) ∧ 𝑆𝑋))
5 sseq2 3960 . . . . . 6 (𝑥 = 𝑋 → (𝑆𝑥𝑆𝑋))
65elrab 3646 . . . . 5 (𝑋 ∈ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥} ↔ (𝑋 ∈ (Clsd‘𝐽) ∧ 𝑆𝑋))
74, 6sylibr 234 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝑋 ∈ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥})
87ne0d 4294 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥} ≠ ∅)
9 ssrab2 4032 . . 3 {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥} ⊆ (Clsd‘𝐽)
10 intcld 22984 . . 3 (({𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥} ≠ ∅ ∧ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥} ⊆ (Clsd‘𝐽)) → {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥} ∈ (Clsd‘𝐽))
118, 9, 10sylancl 586 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋) → {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥} ∈ (Clsd‘𝐽))
122, 11eqeltrd 2836 1 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ∈ (Clsd‘𝐽))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2113  wne 2932  {crab 3399  wss 3901  c0 4285   cuni 4863   cint 4902  cfv 6492  Topctop 22837  Clsdccld 22960  clsccl 22962
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-int 4903  df-iun 4948  df-iin 4949  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-top 22838  df-cld 22963  df-cls 22965
This theorem is referenced by:  clsf  22992  clsss3  23003  iscld3  23008  clsidm  23011  restcls  23125  cncls2i  23214  nrmsep  23301  lpcls  23308  regsep2  23320  hauscmplem  23350  hausllycmp  23438  txcls  23548  ptclsg  23559  regr1lem  23683  kqreglem1  23685  kqreglem2  23686  kqnrmlem1  23687  kqnrmlem2  23688  fclscmpi  23973  tgptsmscld  24095  cnllycmp  24911  clsocv  25206  cmpcmet  25275  cncmet  25278  limcnlp  25835  clsun  36522  cldregopn  36525  heibor1lem  38006  iscnrm3rlem2  49182  iscnrm3rlem5  49185
  Copyright terms: Public domain W3C validator