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

Theorem fncld 20826
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  x  j are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vuniex 6954 . . . 4  |-  U. j  e.  _V
21pwex 4848 . . 3  |-  ~P U. j  e.  _V
32rabex 4813 . 2  |-  { x  e.  ~P U. j  |  ( U. j  \  x )  e.  j }  e.  _V
4 df-cld 20823 . 2  |-  Clsd  =  ( j  e.  Top  |->  { x  e.  ~P U. j  |  ( U. j  \  x )  e.  j } )
53, 4fnmpti 6022 1  |-  Clsd  Fn  Top
Colors of variables: wff setvar class
Syntax hints:    e. wcel 1990   {crab 2916    \ cdif 3571   ~Pcpw 4158   U.cuni 4436    Fn wfn 5883   Topctop 20698   Clsdccld 20820
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-fun 5890  df-fn 5891  df-cld 20823
This theorem is referenced by:  cldrcl  20830  iscldtop  20899
  Copyright terms: Public domain W3C validator