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

Theorem cldval 23334
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 23217 . . 3 (𝐽 ∈ Top → 𝑋 ∈ 𝐽)
3 pwexg 5340 . . 3 (𝑋 ∈ 𝐽 → 𝒫 𝑋 ∈ V)
4 rabexg 5299 . . 3 (𝒫 𝑋 ∈ V → {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽} ∈ V)
52, 3, 43syl 19 . 2 (𝐽 ∈ Top → {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽} ∈ V)
6 unieq 4878 . . . . . 6 (𝑗 = 𝐽 → ∪ 𝑗 = ∪ 𝐽)
76, 1eqtr4di 2814 . . . . 5 (𝑗 = 𝐽 → ∪ 𝑗 = 𝑋)
87pweqd 4574 . . . 4 (𝑗 = 𝐽 → 𝒫 ∪ 𝑗 = 𝒫 𝑋)
97difeq1d 4073 . . . . 5 (𝑗 = 𝐽 → (∪ 𝑗 ∖ 𝑥) = (𝑋 ∖ 𝑥))
10 eleq12 2851 . . . . 5 (((∪ 𝑗 ∖ 𝑥) = (𝑋 ∖ 𝑥) ∧ 𝑗 = 𝐽) → ((∪ 𝑗 ∖ 𝑥) ∈ 𝑗 ↔ (𝑋 ∖ 𝑥) ∈ 𝐽))
119, 10mpancom 701 . . . 4 (𝑗 = 𝐽 → ((∪ 𝑗 ∖ 𝑥) ∈ 𝑗 ↔ (𝑋 ∖ 𝑥) ∈ 𝐽))
128, 11rabeqbidv 3430 . . 3 (𝑗 = 𝐽 → {𝑥 ∈ 𝒫 ∪ 𝑗 ∣ (∪ 𝑗 ∖ 𝑥) ∈ 𝑗} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽})
13 df-cld 23330 . . 3 Clsd = (𝑗 ∈ Top ↦ {𝑥 ∈ 𝒫 ∪ 𝑗 ∣ (∪ 𝑗 ∖ 𝑥) ∈ 𝑗})
1412, 13fvmptg 6989 . 2 ((𝐽 ∈ Top ∧ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽} ∈ V) → (Clsd‘𝐽) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽})
155, 14mpdan 700 1 (𝐽 ∈ Top → (Clsd‘𝐽) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2145  {crab 3413  Vcvv 3451   ∖ cdif 3896  𝒫 cpw 4557  ∪ cuni 4867  ‘cfv 6537  Topctop 23204  Clsdccld 23327
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pow 5327  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6493  df-fun 6539  df-fv 6545  df-top 23205  df-cld 23330
This theorem is used by:  iscld  23338  mretopd  23403
  Copyright terms: Public domain W3C validator