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

Theorem cldval 23396
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 23279 . . 3 (𝐽 ∈ Top → 𝑋 ∈ 𝐽)
3 pwexg 5347 . . 3 (𝑋 ∈ 𝐽 → 𝒫 𝑋 ∈ V)
4 rabexg 5306 . . 3 (𝒫 𝑋 ∈ V → {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽} ∈ V)
52, 3, 43syl 19 . 2 (𝐽 ∈ Top → {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽} ∈ V)
6 unieq 4883 . . . . . 6 (𝑗 = 𝐽 → ∪ 𝑗 = ∪ 𝐽)
76, 1eqtr4di 2816 . . . . 5 (𝑗 = 𝐽 → ∪ 𝑗 = 𝑋)
87pweqd 4577 . . . 4 (𝑗 = 𝐽 → 𝒫 ∪ 𝑗 = 𝒫 𝑋)
97difeq1d 4065 . . . . 5 (𝑗 = 𝐽 → (∪ 𝑗 ∖ 𝑥) = (𝑋 ∖ 𝑥))
10 eleq12 2854 . . . . 5 (((∪ 𝑗 ∖ 𝑥) = (𝑋 ∖ 𝑥) ∧ 𝑗 = 𝐽) → ((∪ 𝑗 ∖ 𝑥) ∈ 𝑗 ↔ (𝑋 ∖ 𝑥) ∈ 𝐽))
119, 10mpancom 701 . . . 4 (𝑗 = 𝐽 → ((∪ 𝑗 ∖ 𝑥) ∈ 𝑗 ↔ (𝑋 ∖ 𝑥) ∈ 𝐽))
128, 11rabeqbidv 3433 . . 3 (𝑗 = 𝐽 → {𝑥 ∈ 𝒫 ∪ 𝑗 ∣ (∪ 𝑗 ∖ 𝑥) ∈ 𝑗} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑥) ∈ 𝐽})
13 df-cld 23392 . . 3 Clsd = (𝑗 ∈ Top ↦ {𝑥 ∈ 𝒫 ∪ 𝑗 ∣ (∪ 𝑗 ∖ 𝑥) ∈ 𝑗})
1412, 13fvmptg 7022 . 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 2147  {crab 3416  Vcvv 3454   ∖ cdif 4048  𝒫 cpw 4560  ∪ cuni 4872  ‘cfv 6566  Topctop 23266  Clsdccld 23389
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pow 5334  ax-pr 5398
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-top 23267  df-cld 23392
This theorem is used by:  iscld  23400  mretopd  23465
  Copyright terms: Public domain W3C validator