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

Theorem cldval 14822
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 14731 . . 3 (𝐽 ∈ Top → 𝑋𝐽)
3 pwexg 4270 . . 3 (𝑋𝐽 → 𝒫 𝑋 ∈ V)
4 rabexg 4233 . . 3 (𝒫 𝑋 ∈ V → {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑥) ∈ 𝐽} ∈ V)
52, 3, 43syl 17 . 2 (𝐽 ∈ Top → {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑥) ∈ 𝐽} ∈ V)
6 unieq 3902 . . . . . 6 (𝑗 = 𝐽 𝑗 = 𝐽)
76, 1eqtr4di 2282 . . . . 5 (𝑗 = 𝐽 𝑗 = 𝑋)
87pweqd 3657 . . . 4 (𝑗 = 𝐽 → 𝒫 𝑗 = 𝒫 𝑋)
97difeq1d 3324 . . . . 5 (𝑗 = 𝐽 → ( 𝑗𝑥) = (𝑋𝑥))
10 eleq12 2296 . . . . 5 ((( 𝑗𝑥) = (𝑋𝑥) ∧ 𝑗 = 𝐽) → (( 𝑗𝑥) ∈ 𝑗 ↔ (𝑋𝑥) ∈ 𝐽))
119, 10mpancom 422 . . . 4 (𝑗 = 𝐽 → (( 𝑗𝑥) ∈ 𝑗 ↔ (𝑋𝑥) ∈ 𝐽))
128, 11rabeqbidv 2797 . . 3 (𝑗 = 𝐽 → {𝑥 ∈ 𝒫 𝑗 ∣ ( 𝑗𝑥) ∈ 𝑗} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑥) ∈ 𝐽})
13 df-cld 14818 . . 3 Clsd = (𝑗 ∈ Top ↦ {𝑥 ∈ 𝒫 𝑗 ∣ ( 𝑗𝑥) ∈ 𝑗})
1412, 13fvmptg 5722 . 2 ((𝐽 ∈ Top ∧ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑥) ∈ 𝐽} ∈ V) → (Clsd‘𝐽) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑥) ∈ 𝐽})
155, 14mpdan 421 1 (𝐽 ∈ Top → (Clsd‘𝐽) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑥) ∈ 𝐽})
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105   = wceq 1397  wcel 2202  {crab 2514  Vcvv 2802  cdif 3197  𝒫 cpw 3652   cuni 3893  cfv 5326  Topctop 14720  Clsdccld 14815
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-top 14721  df-cld 14818
This theorem is referenced by:  iscld  14826
  Copyright terms: Public domain W3C validator