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

Theorem isopn3 14597
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 14582 . . . 4  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( int `  J
) `  S )  =  U. ( J  i^i  ~P S ) )
3 inss2 3394 . . . . . . . 8  |-  ( J  i^i  ~P S ) 
C_  ~P S
43unissi 3873 . . . . . . 7  |-  U. ( J  i^i  ~P S ) 
C_  U. ~P S
5 unipw 4261 . . . . . . 7  |-  U. ~P S  =  S
64, 5sseqtri 3227 . . . . . 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 3630 . . . . . . 7  |-  ( S  e.  J  ->  S  e.  ~P S )
108, 9elind 3358 . . . . . 6  |-  ( S  e.  J  ->  S  e.  ( J  i^i  ~P S ) )
11 elssuni 3878 . . . . . 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 3210 . . . 4  |-  ( S  e.  J  ->  U. ( J  i^i  ~P S )  =  S )
142, 13sylan9eq 2258 . . 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 14589 . . 3  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( int `  J
) `  S )  e.  J )
17 eleq1 2268 . . 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 1373    e. wcel 2176    i^i cin 3165    C_ wss 3166   ~Pcpw 3616   U.cuni 3850   ` cfv 5271   Topctop 14469   intcnt 14565
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 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-coll 4159  ax-sep 4162  ax-pow 4218  ax-pr 4253  ax-un 4480
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-reu 2491  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-iun 3929  df-br 4045  df-opab 4106  df-mpt 4107  df-id 4340  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-iota 5232  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-top 14470  df-ntr 14568
This theorem is referenced by:  ntridm  14598  ntrtop  14600  ntr0  14606  isopn3i  14607  cnntr  14697
  Copyright terms: Public domain W3C validator