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

Theorem iscld 20831
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 20827 . . . 4  |-  ( J  e.  Top  ->  ( Clsd `  J )  =  { x  e.  ~P X  |  ( X  \  x )  e.  J } )
32eleq2d 2687 . . 3  |-  ( J  e.  Top  ->  ( S  e.  ( Clsd `  J )  <->  S  e.  { x  e.  ~P X  |  ( X  \  x )  e.  J } ) )
4 difeq2 3722 . . . . 5  |-  ( x  =  S  ->  ( X  \  x )  =  ( X  \  S
) )
54eleq1d 2686 . . . 4  |-  ( x  =  S  ->  (
( X  \  x
)  e.  J  <->  ( X  \  S )  e.  J
) )
65elrab 3363 . . 3  |-  ( S  e.  { x  e. 
~P X  |  ( X  \  x )  e.  J }  <->  ( S  e.  ~P X  /\  ( X  \  S )  e.  J ) )
73, 6syl6bb 276 . 2  |-  ( J  e.  Top  ->  ( S  e.  ( Clsd `  J )  <->  ( S  e.  ~P X  /\  ( X  \  S )  e.  J ) ) )
81topopn 20711 . . . 4  |-  ( J  e.  Top  ->  X  e.  J )
9 elpw2g 4827 . . . 4  |-  ( X  e.  J  ->  ( S  e.  ~P X  <->  S 
C_  X ) )
108, 9syl 17 . . 3  |-  ( J  e.  Top  ->  ( S  e.  ~P X  <->  S 
C_  X ) )
1110anbi1d 741 . 2  |-  ( J  e.  Top  ->  (
( S  e.  ~P X  /\  ( X  \  S )  e.  J
)  <->  ( S  C_  X  /\  ( X  \  S )  e.  J
) ) )
127, 11bitrd 268 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 196    /\ wa 384    = wceq 1483    e. wcel 1990   {crab 2916    \ cdif 3571    C_ wss 3574   ~Pcpw 4158   U.cuni 4436   ` cfv 5888   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-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
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-sbc 3436  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-iota 5851  df-fun 5890  df-fv 5896  df-top 20699  df-cld 20823
This theorem is referenced by:  iscld2  20832  cldss  20833  cldopn  20835  topcld  20839  discld  20893  indiscld  20895  restcld  20976  ordtcld1  21001  ordtcld2  21002  hauscmp  21210  txcld  21406  ptcld  21416  qtopcld  21516  opnsubg  21911  sszcld  22620  stoweidlem57  40274
  Copyright terms: Public domain W3C validator