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

Theorem eltopspOLD 16672
Description: Construct a topological space from a topology and vice-versa. We say that  A is a topology on  U. A. (This could be proved more efficiently from istpsOLD 16674, but the proof here does not require the Axiom of Regularity.) (Contributed by NM, 8-Mar-2006.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
eltopspOLD  |-  ( <. U. J ,  J >.  e. 
TopSp OLD  <->  J  e.  Top )

Proof of Theorem eltopspOLD
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-br 4040 . . . 4  |-  ( U. J TopSp OLD J  <->  <. U. J ,  J >.  e.  TopSp OLD )
2 relopab 4828 . . . . . 6  |-  Rel  { <. x ,  y >.  |  ( y  e. 
Top  /\  x  =  U. y ) }
3 df-topspOLD 16653 . . . . . . 7  |-  TopSp OLD  =  { <. x ,  y
>.  |  ( y  e.  Top  /\  x  = 
U. y ) }
43releqi 4788 . . . . . 6  |-  ( Rel  TopSp OLD  <->  Rel  { <. x ,  y >.  |  ( y  e.  Top  /\  x  =  U. y
) } )
52, 4mpbir 200 . . . . 5  |-  Rel  TopSp OLD
65brrelexi 4745 . . . 4  |-  ( U. J TopSp OLD J  ->  U. J  e.  _V )
71, 6sylbir 204 . . 3  |-  ( <. U. J ,  J >.  e. 
TopSp OLD  ->  U. J  e. 
_V )
8 uniexb 4579 . . . 4  |-  ( J  e.  _V  <->  U. J  e. 
_V )
97, 8sylibr 203 . . 3  |-  ( <. U. J ,  J >.  e. 
TopSp OLD  ->  J  e.  _V )
107, 9jca 518 . 2  |-  ( <. U. J ,  J >.  e. 
TopSp OLD  ->  ( U. J  e.  _V  /\  J  e.  _V ) )
11 uniexg 4533 . . 3  |-  ( J  e.  Top  ->  U. J  e.  _V )
12 elex 2809 . . 3  |-  ( J  e.  Top  ->  J  e.  _V )
1311, 12jca 518 . 2  |-  ( J  e.  Top  ->  ( U. J  e.  _V  /\  J  e.  _V )
)
14 eqeq1 2302 . . . . 5  |-  ( x  =  U. J  -> 
( x  =  U. y 
<-> 
U. J  =  U. y ) )
1514anbi2d 684 . . . 4  |-  ( x  =  U. J  -> 
( ( y  e. 
Top  /\  x  =  U. y )  <->  ( y  e.  Top  /\  U. J  =  U. y ) ) )
16 eleq1 2356 . . . . 5  |-  ( y  =  J  ->  (
y  e.  Top  <->  J  e.  Top ) )
17 unieq 3852 . . . . . 6  |-  ( y  =  J  ->  U. y  =  U. J )
1817eqeq2d 2307 . . . . 5  |-  ( y  =  J  ->  ( U. J  =  U. y 
<-> 
U. J  =  U. J ) )
1916, 18anbi12d 691 . . . 4  |-  ( y  =  J  ->  (
( y  e.  Top  /\ 
U. J  =  U. y )  <->  ( J  e.  Top  /\  U. J  =  U. J ) ) )
2015, 19opelopabg 4299 . . 3  |-  ( ( U. J  e.  _V  /\  J  e.  _V )  ->  ( <. U. J ,  J >.  e.  { <. x ,  y >.  |  ( y  e.  Top  /\  x  =  U. y
) }  <->  ( J  e.  Top  /\  U. J  =  U. J ) ) )
213eleq2i 2360 . . 3  |-  ( <. U. J ,  J >.  e. 
TopSp OLD  <->  <. U. J ,  J >.  e.  { <. x ,  y >.  |  ( y  e.  Top  /\  x  =  U. y
) } )
22 eqid 2296 . . . 4  |-  U. J  =  U. J
2322biantru 491 . . 3  |-  ( J  e.  Top  <->  ( J  e.  Top  /\  U. J  =  U. J ) )
2420, 21, 233bitr4g 279 . 2  |-  ( ( U. J  e.  _V  /\  J  e.  _V )  ->  ( <. U. J ,  J >.  e.  TopSp OLD  <->  J  e.  Top ) )
2510, 13, 24pm5.21nii 342 1  |-  ( <. U. J ,  J >.  e. 
TopSp OLD  <->  J  e.  Top )
Colors of variables: wff set class
Syntax hints:    <-> wb 176    /\ wa 358    = wceq 1632    e. wcel 1696   _Vcvv 2801   <.cop 3656   U.cuni 3843   class class class wbr 4039   {copab 4092   Rel wrel 4710   Topctop 16647   TopSp OLDctpsOLD 16649
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-br 4040  df-opab 4094  df-xp 4711  df-rel 4712  df-topspOLD 16653
  Copyright terms: Public domain W3C validator