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

Theorem iscld 16820
Description: The predicate " S is a closed set." (Contributed by NM, 2-Oct-2006.) (Revised by Mario Carneiro, 11-Nov-2013.)
Hypothesis
Ref Expression
iscld.1  |-  X  = 
U. J
Assertion
Ref Expression
iscld  |-  ( J  e.  Top  ->  ( S  e.  ( Clsd `  J )  <->  ( S  C_  X  /\  ( X 
\  S )  e.  J ) ) )

Proof of Theorem iscld
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 iscld.1 . . . . 5  |-  X  = 
U. J
21cldval 16816 . . . 4  |-  ( J  e.  Top  ->  ( Clsd `  J )  =  { x  e.  ~P X  |  ( X  \  x )  e.  J } )
32eleq2d 2383 . . 3  |-  ( J  e.  Top  ->  ( S  e.  ( Clsd `  J )  <->  S  e.  { x  e.  ~P X  |  ( X  \  x )  e.  J } ) )
4 difeq2 3322 . . . . 5  |-  ( x  =  S  ->  ( X  \  x )  =  ( X  \  S
) )
54eleq1d 2382 . . . 4  |-  ( x  =  S  ->  (
( X  \  x
)  e.  J  <->  ( X  \  S )  e.  J
) )
65elrab 2957 . . 3  |-  ( S  e.  { x  e. 
~P X  |  ( X  \  x )  e.  J }  <->  ( S  e.  ~P X  /\  ( X  \  S )  e.  J ) )
73, 6syl6bb 252 . 2  |-  ( J  e.  Top  ->  ( S  e.  ( Clsd `  J )  <->  ( S  e.  ~P X  /\  ( X  \  S )  e.  J ) ) )
81topopn 16708 . . . 4  |-  ( J  e.  Top  ->  X  e.  J )
9 elpw2g 4211 . . . 4  |-  ( X  e.  J  ->  ( S  e.  ~P X  <->  S 
C_  X ) )
108, 9syl 15 . . 3  |-  ( J  e.  Top  ->  ( S  e.  ~P X  <->  S 
C_  X ) )
1110anbi1d 685 . 2  |-  ( J  e.  Top  ->  (
( S  e.  ~P X  /\  ( X  \  S )  e.  J
)  <->  ( S  C_  X  /\  ( X  \  S )  e.  J
) ) )
127, 11bitrd 244 1  |-  ( J  e.  Top  ->  ( S  e.  ( Clsd `  J )  <->  ( S  C_  X  /\  ( X 
\  S )  e.  J ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    = wceq 1633    e. wcel 1701   {crab 2581    \ cdif 3183    C_ wss 3186   ~Pcpw 3659   U.cuni 3864   ` cfv 5292   Topctop 16687   Clsdccld 16809
This theorem is referenced by:  iscld2  16821  cldss  16822  cldopn  16824  topcld  16828  discld  16882  indiscld  16884  restcld  16959  ordtcld1  16983  ordtcld2  16984  hauscmp  17190  txcld  17354  ptcld  17363  qtopcld  17460  opnsubg  17842  stoweidlem57  26954
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1537  ax-5 1548  ax-17 1607  ax-9 1645  ax-8 1666  ax-14 1705  ax-6 1720  ax-7 1725  ax-11 1732  ax-12 1897  ax-ext 2297  ax-sep 4178  ax-nul 4186  ax-pow 4225  ax-pr 4251
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1533  df-nf 1536  df-sb 1640  df-eu 2180  df-mo 2181  df-clab 2303  df-cleq 2309  df-clel 2312  df-nfc 2441  df-ne 2481  df-ral 2582  df-rex 2583  df-rab 2586  df-v 2824  df-sbc 3026  df-dif 3189  df-un 3191  df-in 3193  df-ss 3200  df-nul 3490  df-if 3600  df-pw 3661  df-sn 3680  df-pr 3681  df-op 3683  df-uni 3865  df-br 4061  df-opab 4115  df-mpt 4116  df-id 4346  df-xp 4732  df-rel 4733  df-cnv 4734  df-co 4735  df-dm 4736  df-iota 5256  df-fun 5294  df-fv 5300  df-top 16692  df-cld 16812
  Copyright terms: Public domain W3C validator