ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cldval GIF version

Theorem cldval 14278
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 14187 . . 3 (𝐽 ∈ Top → 𝑋𝐽)
3 pwexg 4210 . . 3 (𝑋𝐽 → 𝒫 𝑋 ∈ V)
4 rabexg 4173 . . 3 (𝒫 𝑋 ∈ V → {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑥) ∈ 𝐽} ∈ V)
52, 3, 43syl 17 . 2 (𝐽 ∈ Top → {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑥) ∈ 𝐽} ∈ V)
6 unieq 3845 . . . . . 6 (𝑗 = 𝐽 𝑗 = 𝐽)
76, 1eqtr4di 2244 . . . . 5 (𝑗 = 𝐽 𝑗 = 𝑋)
87pweqd 3607 . . . 4 (𝑗 = 𝐽 → 𝒫 𝑗 = 𝒫 𝑋)
97difeq1d 3277 . . . . 5 (𝑗 = 𝐽 → ( 𝑗𝑥) = (𝑋𝑥))
10 eleq12 2258 . . . . 5 ((( 𝑗𝑥) = (𝑋𝑥) ∧ 𝑗 = 𝐽) → (( 𝑗𝑥) ∈ 𝑗 ↔ (𝑋𝑥) ∈ 𝐽))
119, 10mpancom 422 . . . 4 (𝑗 = 𝐽 → (( 𝑗𝑥) ∈ 𝑗 ↔ (𝑋𝑥) ∈ 𝐽))
128, 11rabeqbidv 2755 . . 3 (𝑗 = 𝐽 → {𝑥 ∈ 𝒫 𝑗 ∣ ( 𝑗𝑥) ∈ 𝑗} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑥) ∈ 𝐽})
13 df-cld 14274 . . 3 Clsd = (𝑗 ∈ Top ↦ {𝑥 ∈ 𝒫 𝑗 ∣ ( 𝑗𝑥) ∈ 𝑗})
1412, 13fvmptg 5634 . 2 ((𝐽 ∈ Top ∧ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑥) ∈ 𝐽} ∈ V) → (Clsd‘𝐽) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑥) ∈ 𝐽})
155, 14mpdan 421 1 (𝐽 ∈ Top → (Clsd‘𝐽) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑥) ∈ 𝐽})
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105   = wceq 1364  wcel 2164  {crab 2476  Vcvv 2760  cdif 3151  𝒫 cpw 3602   cuni 3836  cfv 5255  Topctop 14176  Clsdccld 14271
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2987  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-iota 5216  df-fun 5257  df-fv 5263  df-top 14177  df-cld 14274
This theorem is referenced by:  iscld  14282
  Copyright terms: Public domain W3C validator