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

Theorem discld 14304
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 14253 . . . . 5  |-  ( A  e.  V  ->  ~P A  e.  Top )
2 unipw 4246 . . . . . . 7  |-  U. ~P A  =  A
32eqcomi 2197 . . . . . 6  |-  A  = 
U. ~P A
43iscld 14271 . . . . 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 3285 . . . . . 6  |-  ( A 
\  x )  C_  A
7 elpw2g 4185 . . . . . 6  |-  ( A  e.  V  ->  (
( A  \  x
)  e.  ~P A  <->  ( A  \  x ) 
C_  A ) )
86, 7mpbiri 168 . . . . 5  |-  ( A  e.  V  ->  ( A  \  x )  e. 
~P A )
98biantrud 304 . . . 4  |-  ( A  e.  V  ->  (
x  C_  A  <->  ( x  C_  A  /\  ( A 
\  x )  e. 
~P A ) ) )
105, 9bitr4d 191 . . 3  |-  ( A  e.  V  ->  (
x  e.  ( Clsd `  ~P A )  <->  x  C_  A
) )
11 velpw 3608 . . 3  |-  ( x  e.  ~P A  <->  x  C_  A
)
1210, 11bitr4di 198 . 2  |-  ( A  e.  V  ->  (
x  e.  ( Clsd `  ~P A )  <->  x  e.  ~P A ) )
1312eqrdv 2191 1  |-  ( A  e.  V  ->  ( Clsd `  ~P A )  =  ~P A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1364    e. wcel 2164    \ cdif 3150    C_ wss 3153   ~Pcpw 3601   U.cuni 3835   ` cfv 5254   Topctop 14165   Clsdccld 14260
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2986  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-iota 5215  df-fun 5256  df-fv 5262  df-top 14166  df-cld 14263
This theorem is referenced by:  sn0cld  14305
  Copyright terms: Public domain W3C validator