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

Theorem topopn 15109
Description: The underlying set of a topology is an open set. (Contributed by NM, 17-Jul-2006.)
Hypothesis
Ref Expression
1open.1  |-  X  = 
U. J
Assertion
Ref Expression
topopn  |-  ( J  e.  Top  ->  X  e.  J )

Proof of Theorem topopn
StepHypRef Expression
1 1open.1 . 2  |-  X  = 
U. J
2 ssid 3268 . . 3  |-  J  C_  J
3 uniopn 15102 . . 3  |-  ( ( J  e.  Top  /\  J  C_  J )  ->  U. J  e.  J
)
42, 3mpan2 429 . 2  |-  ( J  e.  Top  ->  U. J  e.  J )
51, 4eqeltrid 2325 1  |-  ( J  e.  Top  ->  X  e.  J )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402    e. wcel 2209    C_ wss 3220   U.cuni 3935   Topctop 15098
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  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-ext 2220  ax-sep 4249
This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-in 3226  df-ss 3233  df-pw 3690  df-uni 3936  df-top 15099
This theorem is used by:  toponmax  15126  cldval  15200  ntrfval  15201  clsfval  15202  iscld  15204  ntrval  15211  clsval  15212  0cld  15213  ntrtop  15229  neifval  15241  neif  15242  neival  15244  isnei  15245  tpnei  15261  cnrest  15336  txcn  15376  dvply1  15866
  Copyright terms: Public domain W3C validator