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

Theorem iscld 19394
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 19390 . . . 4  |-  ( J  e.  Top  ->  ( Clsd `  J )  =  { x  e.  ~P X  |  ( X  \  x )  e.  J } )
32eleq2d 2511 . . 3  |-  ( J  e.  Top  ->  ( S  e.  ( Clsd `  J )  <->  S  e.  { x  e.  ~P X  |  ( X  \  x )  e.  J } ) )
4 difeq2 3598 . . . . 5  |-  ( x  =  S  ->  ( X  \  x )  =  ( X  \  S
) )
54eleq1d 2510 . . . 4  |-  ( x  =  S  ->  (
( X  \  x
)  e.  J  <->  ( X  \  S )  e.  J
) )
65elrab 3241 . . 3  |-  ( S  e.  { x  e. 
~P X  |  ( X  \  x )  e.  J }  <->  ( S  e.  ~P X  /\  ( X  \  S )  e.  J ) )
73, 6syl6bb 261 . 2  |-  ( J  e.  Top  ->  ( S  e.  ( Clsd `  J )  <->  ( S  e.  ~P X  /\  ( X  \  S )  e.  J ) ) )
81topopn 19282 . . . 4  |-  ( J  e.  Top  ->  X  e.  J )
9 elpw2g 4596 . . . 4  |-  ( X  e.  J  ->  ( S  e.  ~P X  <->  S 
C_  X ) )
108, 9syl 16 . . 3  |-  ( J  e.  Top  ->  ( S  e.  ~P X  <->  S 
C_  X ) )
1110anbi1d 704 . 2  |-  ( J  e.  Top  ->  (
( S  e.  ~P X  /\  ( X  \  S )  e.  J
)  <->  ( S  C_  X  /\  ( X  \  S )  e.  J
) ) )
127, 11bitrd 253 1  |-  ( J  e.  Top  ->  ( S  e.  ( Clsd `  J )  <->  ( S  C_  X  /\  ( X 
\  S )  e.  J ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    = wceq 1381    e. wcel 1802   {crab 2795    \ cdif 3455    C_ wss 3458   ~Pcpw 3993   U.cuni 4230   ` cfv 5574   Topctop 19261   Clsdccld 19383
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1603  ax-4 1616  ax-5 1689  ax-6 1732  ax-7 1774  ax-9 1806  ax-10 1821  ax-11 1826  ax-12 1838  ax-13 1983  ax-ext 2419  ax-sep 4554  ax-nul 4562  ax-pow 4611  ax-pr 4672
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 974  df-tru 1384  df-ex 1598  df-nf 1602  df-sb 1725  df-eu 2270  df-mo 2271  df-clab 2427  df-cleq 2433  df-clel 2436  df-nfc 2591  df-ne 2638  df-ral 2796  df-rex 2797  df-rab 2800  df-v 3095  df-sbc 3312  df-dif 3461  df-un 3463  df-in 3465  df-ss 3472  df-nul 3768  df-if 3923  df-pw 3995  df-sn 4011  df-pr 4013  df-op 4017  df-uni 4231  df-br 4434  df-opab 4492  df-mpt 4493  df-id 4781  df-xp 4991  df-rel 4992  df-cnv 4993  df-co 4994  df-dm 4995  df-iota 5537  df-fun 5576  df-fv 5582  df-top 19266  df-cld 19386
This theorem is referenced by:  iscld2  19395  cldss  19396  cldopn  19398  topcld  19402  discld  19456  indiscld  19458  restcld  19539  ordtcld1  19564  ordtcld2  19565  hauscmp  19773  txcld  19970  ptcld  19980  qtopcld  20080  opnsubg  20472  sszcld  21188  stoweidlem57  31724
  Copyright terms: Public domain W3C validator