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

Theorem distop 14672
Description: The discrete topology on a set  A. Part of Example 2 in [Munkres] p. 77. (Contributed by FL, 17-Jul-2006.) (Revised by Mario Carneiro, 19-Mar-2015.)
Assertion
Ref Expression
distop  |-  ( A  e.  V  ->  ~P A  e.  Top )

Proof of Theorem distop
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 uniss 3885 . . . . . 6  |-  ( x 
C_  ~P A  ->  U. x  C_ 
U. ~P A )
2 unipw 4279 . . . . . 6  |-  U. ~P A  =  A
31, 2sseqtrdi 3249 . . . . 5  |-  ( x 
C_  ~P A  ->  U. x  C_  A )
4 vuniex 4503 . . . . . 6  |-  U. x  e.  _V
54elpw 3632 . . . . 5  |-  ( U. x  e.  ~P A  <->  U. x  C_  A )
63, 5sylibr 134 . . . 4  |-  ( x 
C_  ~P A  ->  U. x  e.  ~P A )
76ax-gen 1473 . . 3  |-  A. x
( x  C_  ~P A  ->  U. x  e.  ~P A )
87a1i 9 . 2  |-  ( A  e.  V  ->  A. x
( x  C_  ~P A  ->  U. x  e.  ~P A ) )
9 velpw 3633 . . . . . 6  |-  ( x  e.  ~P A  <->  x  C_  A
)
10 velpw 3633 . . . . . . . 8  |-  ( y  e.  ~P A  <->  y  C_  A )
11 ssinss1 3410 . . . . . . . . . 10  |-  ( x 
C_  A  ->  (
x  i^i  y )  C_  A )
1211a1i 9 . . . . . . . . 9  |-  ( y 
C_  A  ->  (
x  C_  A  ->  ( x  i^i  y ) 
C_  A ) )
13 vex 2779 . . . . . . . . . . 11  |-  y  e. 
_V
1413inex2 4195 . . . . . . . . . 10  |-  ( x  i^i  y )  e. 
_V
1514elpw 3632 . . . . . . . . 9  |-  ( ( x  i^i  y )  e.  ~P A  <->  ( x  i^i  y )  C_  A
)
1612, 15imbitrrdi 162 . . . . . . . 8  |-  ( y 
C_  A  ->  (
x  C_  A  ->  ( x  i^i  y )  e.  ~P A ) )
1710, 16sylbi 121 . . . . . . 7  |-  ( y  e.  ~P A  -> 
( x  C_  A  ->  ( x  i^i  y
)  e.  ~P A
) )
1817com12 30 . . . . . 6  |-  ( x 
C_  A  ->  (
y  e.  ~P A  ->  ( x  i^i  y
)  e.  ~P A
) )
199, 18sylbi 121 . . . . 5  |-  ( x  e.  ~P A  -> 
( y  e.  ~P A  ->  ( x  i^i  y )  e.  ~P A ) )
2019ralrimiv 2580 . . . 4  |-  ( x  e.  ~P A  ->  A. y  e.  ~P  A ( x  i^i  y )  e.  ~P A )
2120rgen 2561 . . 3  |-  A. x  e.  ~P  A A. y  e.  ~P  A ( x  i^i  y )  e. 
~P A
2221a1i 9 . 2  |-  ( A  e.  V  ->  A. x  e.  ~P  A A. y  e.  ~P  A ( x  i^i  y )  e. 
~P A )
23 pwexg 4240 . . 3  |-  ( A  e.  V  ->  ~P A  e.  _V )
24 istopg 14586 . . 3  |-  ( ~P A  e.  _V  ->  ( ~P A  e.  Top  <->  ( A. x ( x  C_  ~P A  ->  U. x  e.  ~P A )  /\  A. x  e.  ~P  A A. y  e.  ~P  A ( x  i^i  y )  e.  ~P A ) ) )
2523, 24syl 14 . 2  |-  ( A  e.  V  ->  ( ~P A  e.  Top  <->  ( A. x ( x  C_  ~P A  ->  U. x  e.  ~P A )  /\  A. x  e.  ~P  A A. y  e.  ~P  A ( x  i^i  y )  e.  ~P A ) ) )
268, 22, 25mpbir2and 947 1  |-  ( A  e.  V  ->  ~P A  e.  Top )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105   A.wal 1371    e. wcel 2178   A.wral 2486   _Vcvv 2776    i^i cin 3173    C_ wss 3174   ~Pcpw 3626   U.cuni 3864   Topctop 14584
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-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-un 4498
This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-v 2778  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-uni 3865  df-top 14585
This theorem is referenced by:  topnex  14673  distopon  14674  distps  14678  discld  14723  restdis  14771  txdis  14864
  Copyright terms: Public domain W3C validator