Theorem fncld 23070

Description: The closed-set generator is a well-behaved function. (Contributed by Stefan O'Rear, 1-Feb-2015.)

Assertion

Ref	Expression
fncld	⊢ Clsd Fn Top

Proof of Theorem fncld

Dummy variables 𝑥 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vuniex 7717	. . . 4 ⊢ ∪ 𝑗 ∈ V
2	1	pwex 5334	. . 3 ⊢ 𝒫 ∪ 𝑗 ∈ V
3	2	rabex 5292	. 2 ⊢ {𝑥 ∈ 𝒫 ∪ 𝑗 ∣ (∪ 𝑗 ∖ 𝑥) ∈ 𝑗} ∈ V
4		df-cld 23067	. 2 ⊢ Clsd = (𝑗 ∈ Top ↦ {𝑥 ∈ 𝒫 ∪ 𝑗 ∣ (∪ 𝑗 ∖ 𝑥) ∈ 𝑗})
5	3, 4	fnmpti 6659	1 ⊢ Clsd Fn Top

Syntax hints:   ∈ wcel 2141  {crab 3413   ∖ cdif 3899  𝒫 cpw 4552  ∪ cuni 4862   Fn wfn 6511  Topctop 22941  Clsdccld 23064

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-pow 5319  ax-pr 5387  ax-un 7713

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-fun 6518  df-fn 6519  df-cld 23067

This theorem is referenced by:  cldrcl  23074  iscldtop  23143