ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  discld Unicode version

Theorem discld 12930
Description: The open sets of a discrete topology are closed and its closed sets are open. (Contributed by FL, 7-Jun-2007.) (Revised by Mario Carneiro, 7-Apr-2015.)
Assertion
Ref Expression
discld  |-  ( A  e.  V  ->  ( Clsd `  ~P A )  =  ~P A )

Proof of Theorem discld
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 distop 12879 . . . . 5  |-  ( A  e.  V  ->  ~P A  e.  Top )
2 unipw 4202 . . . . . . 7  |-  U. ~P A  =  A
32eqcomi 2174 . . . . . 6  |-  A  = 
U. ~P A
43iscld 12897 . . . . 5  |-  ( ~P A  e.  Top  ->  ( x  e.  ( Clsd `  ~P A )  <->  ( x  C_  A  /\  ( A 
\  x )  e. 
~P A ) ) )
51, 4syl 14 . . . 4  |-  ( A  e.  V  ->  (
x  e.  ( Clsd `  ~P A )  <->  ( x  C_  A  /\  ( A 
\  x )  e. 
~P A ) ) )
6 difss 3253 . . . . . 6  |-  ( A 
\  x )  C_  A
7 elpw2g 4142 . . . . . 6  |-  ( A  e.  V  ->  (
( A  \  x
)  e.  ~P A  <->  ( A  \  x ) 
C_  A ) )
86, 7mpbiri 167 . . . . 5  |-  ( A  e.  V  ->  ( A  \  x )  e. 
~P A )
98biantrud 302 . . . 4  |-  ( A  e.  V  ->  (
x  C_  A  <->  ( x  C_  A  /\  ( A 
\  x )  e. 
~P A ) ) )
105, 9bitr4d 190 . . 3  |-  ( A  e.  V  ->  (
x  e.  ( Clsd `  ~P A )  <->  x  C_  A
) )
11 velpw 3573 . . 3  |-  ( x  e.  ~P A  <->  x  C_  A
)
1210, 11bitr4di 197 . 2  |-  ( A  e.  V  ->  (
x  e.  ( Clsd `  ~P A )  <->  x  e.  ~P A ) )
1312eqrdv 2168 1  |-  ( A  e.  V  ->  ( Clsd `  ~P A )  =  ~P A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1348    e. wcel 2141    \ cdif 3118    C_ wss 3121   ~Pcpw 3566   U.cuni 3796   ` cfv 5198   Topctop 12789   Clsdccld 12886
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-rab 2457  df-v 2732  df-sbc 2956  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-mpt 4052  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-iota 5160  df-fun 5200  df-fv 5206  df-top 12790  df-cld 12889
This theorem is referenced by:  sn0cld  12931
  Copyright terms: Public domain W3C validator