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

Theorem isopn3 14110
Description: A subset is open iff it equals its own interior. (Contributed by NM, 9-Oct-2006.) (Revised by Mario Carneiro, 11-Nov-2013.)
Hypothesis
Ref Expression
clscld.1  |-  X  = 
U. J
Assertion
Ref Expression
isopn3  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( S  e.  J  <->  ( ( int `  J
) `  S )  =  S ) )

Proof of Theorem isopn3
StepHypRef Expression
1 clscld.1 . . . . 5  |-  X  = 
U. J
21ntrval 14095 . . . 4  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( int `  J
) `  S )  =  U. ( J  i^i  ~P S ) )
3 inss2 3371 . . . . . . . 8  |-  ( J  i^i  ~P S ) 
C_  ~P S
43unissi 3850 . . . . . . 7  |-  U. ( J  i^i  ~P S ) 
C_  U. ~P S
5 unipw 4238 . . . . . . 7  |-  U. ~P S  =  S
64, 5sseqtri 3204 . . . . . 6  |-  U. ( J  i^i  ~P S ) 
C_  S
76a1i 9 . . . . 5  |-  ( S  e.  J  ->  U. ( J  i^i  ~P S ) 
C_  S )
8 id 19 . . . . . . 7  |-  ( S  e.  J  ->  S  e.  J )
9 pwidg 3607 . . . . . . 7  |-  ( S  e.  J  ->  S  e.  ~P S )
108, 9elind 3335 . . . . . 6  |-  ( S  e.  J  ->  S  e.  ( J  i^i  ~P S ) )
11 elssuni 3855 . . . . . 6  |-  ( S  e.  ( J  i^i  ~P S )  ->  S  C_ 
U. ( J  i^i  ~P S ) )
1210, 11syl 14 . . . . 5  |-  ( S  e.  J  ->  S  C_ 
U. ( J  i^i  ~P S ) )
137, 12eqssd 3187 . . . 4  |-  ( S  e.  J  ->  U. ( J  i^i  ~P S )  =  S )
142, 13sylan9eq 2242 . . 3  |-  ( ( ( J  e.  Top  /\  S  C_  X )  /\  S  e.  J
)  ->  ( ( int `  J ) `  S )  =  S )
1514ex 115 . 2  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( S  e.  J  ->  ( ( int `  J
) `  S )  =  S ) )
161ntropn 14102 . . 3  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( int `  J
) `  S )  e.  J )
17 eleq1 2252 . . 3  |-  ( ( ( int `  J
) `  S )  =  S  ->  ( ( ( int `  J
) `  S )  e.  J  <->  S  e.  J
) )
1816, 17syl5ibcom 155 . 2  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( ( int `  J ) `  S
)  =  S  ->  S  e.  J )
)
1915, 18impbid 129 1  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( S  e.  J  <->  ( ( int `  J
) `  S )  =  S ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1364    e. wcel 2160    i^i cin 3143    C_ wss 3144   ~Pcpw 3593   U.cuni 3827   ` cfv 5238   Topctop 13982   intcnt 14078
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 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 2162  ax-14 2163  ax-ext 2171  ax-coll 4136  ax-sep 4139  ax-pow 4195  ax-pr 4230  ax-un 4454
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ral 2473  df-rex 2474  df-reu 2475  df-rab 2477  df-v 2754  df-sbc 2978  df-csb 3073  df-un 3148  df-in 3150  df-ss 3157  df-pw 3595  df-sn 3616  df-pr 3617  df-op 3619  df-uni 3828  df-iun 3906  df-br 4022  df-opab 4083  df-mpt 4084  df-id 4314  df-xp 4653  df-rel 4654  df-cnv 4655  df-co 4656  df-dm 4657  df-rn 4658  df-res 4659  df-ima 4660  df-iota 5199  df-fun 5240  df-fn 5241  df-f 5242  df-f1 5243  df-fo 5244  df-f1o 5245  df-fv 5246  df-top 13983  df-ntr 14081
This theorem is referenced by:  ntridm  14111  ntrtop  14113  ntr0  14119  isopn3i  14120  cnntr  14210
  Copyright terms: Public domain W3C validator