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

Theorem cldval 23145
Description: The set of closed sets of a topology. (Note that the set of open sets is just the topology itself, so we don't have a separate definition.) (Contributed by NM, 2-Oct-2006.) (Revised by Mario Carneiro, 11-Nov-2013.)
Hypothesis
Ref Expression
cldval.1 𝑋 = 𝐽
Assertion
Ref Expression
cldval (𝐽 ∈ Top → (Clsd‘𝐽) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑥) ∈ 𝐽})
Distinct variable groups:   𝑥,𝐽   𝑥,𝑋

Proof of Theorem cldval
Dummy variable 𝑗 is distinct from all other variables.
StepHypRef Expression
1 cldval.1 . . . 4 𝑋 = 𝐽
21topopn 23028 . . 3 (𝐽 ∈ Top → 𝑋𝐽)
3 pwexg 5347 . . 3 (𝑋𝐽 → 𝒫 𝑋 ∈ V)
4 rabexg 5305 . . 3 (𝒫 𝑋 ∈ V → {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑥) ∈ 𝐽} ∈ V)
52, 3, 43syl 19 . 2 (𝐽 ∈ Top → {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑥) ∈ 𝐽} ∈ V)
6 unieq 4884 . . . . . 6 (𝑗 = 𝐽 𝑗 = 𝐽)
76, 1eqtr4di 2822 . . . . 5 (𝑗 = 𝐽 𝑗 = 𝑋)
87pweqd 4581 . . . 4 (𝑗 = 𝐽 → 𝒫 𝑗 = 𝒫 𝑋)
97difeq1d 4088 . . . . 5 (𝑗 = 𝐽 → ( 𝑗𝑥) = (𝑋𝑥))
10 eleq12 2859 . . . . 5 ((( 𝑗𝑥) = (𝑋𝑥) ∧ 𝑗 = 𝐽) → (( 𝑗𝑥) ∈ 𝑗 ↔ (𝑋𝑥) ∈ 𝐽))
119, 10mpancom 700 . . . 4 (𝑗 = 𝐽 → (( 𝑗𝑥) ∈ 𝑗 ↔ (𝑋𝑥) ∈ 𝐽))
128, 11rabeqbidv 3441 . . 3 (𝑗 = 𝐽 → {𝑥 ∈ 𝒫 𝑗 ∣ ( 𝑗𝑥) ∈ 𝑗} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑥) ∈ 𝐽})
13 df-cld 23141 . . 3 Clsd = (𝑗 ∈ Top ↦ {𝑥 ∈ 𝒫 𝑗 ∣ ( 𝑗𝑥) ∈ 𝑗})
1412, 13fvmptg 6985 . 2 ((𝐽 ∈ Top ∧ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑥) ∈ 𝐽} ∈ V) → (Clsd‘𝐽) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑥) ∈ 𝐽})
155, 14mpdan 699 1 (𝐽 ∈ Top → (Clsd‘𝐽) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑥) ∈ 𝐽})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209   = wceq 1567  wcel 2149  {crab 3423  Vcvv 3463  cdif 3910  𝒫 cpw 4564   cuni 4873  cfv 6533  Topctop 23015  Clsdccld 23138
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-pow 5334  ax-pr 5402
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6489  df-fun 6535  df-fv 6541  df-top 23016  df-cld 23141
This theorem is referenced by:  iscld  23149  mretopd  23214
  Copyright terms: Public domain W3C validator