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

Theorem discld 15237
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 15186 . . . . 5  |-  ( A  e.  V  ->  ~P A  e.  Top )
2 unipw 4357 . . . . . . 7  |-  U. ~P A  =  A
32eqcomi 2242 . . . . . 6  |-  A  = 
U. ~P A
43iscld 15204 . . . . 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 3355 . . . . . 6  |-  ( A 
\  x )  C_  A
7 elpw2g 4292 . . . . . 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 3695 . . 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 2236 1  |-  ( A  e.  V  ->  ( Clsd `  ~P A )  =  ~P A )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209    \ cdif 3217    C_ wss 3220   ~Pcpw 3688   U.cuni 3935   ` cfv 5377   Topctop 15098   Clsdccld 15193
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-top 15099  df-cld 15196
This theorem is used by:  sn0cld  15238
  Copyright terms: Public domain W3C validator