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

Theorem clsfval 22928
Description: The closure function on the subsets of a topology's base set. (Contributed by NM, 3-Oct-2006.) (Revised by Mario Carneiro, 11-Nov-2013.)
Hypothesis
Ref Expression
cldval.1 𝑋 = 𝐽
Assertion
Ref Expression
clsfval (𝐽 ∈ Top → (cls‘𝐽) = (𝑥 ∈ 𝒫 𝑋 {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥𝑦}))
Distinct variable groups:   𝑥,𝑦,𝐽   𝑥,𝑋
Allowed substitution hint:   𝑋(𝑦)

Proof of Theorem clsfval
Dummy variable 𝑗 is distinct from all other variables.
StepHypRef Expression
1 cldval.1 . . . 4 𝑋 = 𝐽
21topopn 22809 . . 3 (𝐽 ∈ Top → 𝑋𝐽)
3 pwexg 5320 . . 3 (𝑋𝐽 → 𝒫 𝑋 ∈ V)
4 mptexg 7161 . . 3 (𝒫 𝑋 ∈ V → (𝑥 ∈ 𝒫 𝑋 {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥𝑦}) ∈ V)
52, 3, 43syl 18 . 2 (𝐽 ∈ Top → (𝑥 ∈ 𝒫 𝑋 {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥𝑦}) ∈ V)
6 unieq 4872 . . . . . 6 (𝑗 = 𝐽 𝑗 = 𝐽)
76, 1eqtr4di 2782 . . . . 5 (𝑗 = 𝐽 𝑗 = 𝑋)
87pweqd 4570 . . . 4 (𝑗 = 𝐽 → 𝒫 𝑗 = 𝒫 𝑋)
9 fveq2 6826 . . . . . 6 (𝑗 = 𝐽 → (Clsd‘𝑗) = (Clsd‘𝐽))
109rabeqdv 3412 . . . . 5 (𝑗 = 𝐽 → {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥𝑦} = {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥𝑦})
1110inteqd 4904 . . . 4 (𝑗 = 𝐽 {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥𝑦} = {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥𝑦})
128, 11mpteq12dv 5182 . . 3 (𝑗 = 𝐽 → (𝑥 ∈ 𝒫 𝑗 {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥𝑦}) = (𝑥 ∈ 𝒫 𝑋 {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥𝑦}))
13 df-cls 22924 . . 3 cls = (𝑗 ∈ Top ↦ (𝑥 ∈ 𝒫 𝑗 {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥𝑦}))
1412, 13fvmptg 6932 . 2 ((𝐽 ∈ Top ∧ (𝑥 ∈ 𝒫 𝑋 {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥𝑦}) ∈ V) → (cls‘𝐽) = (𝑥 ∈ 𝒫 𝑋 {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥𝑦}))
155, 14mpdan 687 1 (𝐽 ∈ Top → (cls‘𝐽) = (𝑥 ∈ 𝒫 𝑋 {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥𝑦}))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1540  wcel 2109  {crab 3396  Vcvv 3438  wss 3905  𝒫 cpw 4553   cuni 4861   cint 4899  cmpt 5176  cfv 6486  Topctop 22796  Clsdccld 22919  clsccl 22921
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-int 4900  df-iun 4946  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-top 22797  df-cls 22924
This theorem is referenced by:  clsval  22940  clsf  22951  mrccls  22982
  Copyright terms: Public domain W3C validator