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

Theorem ntrval 14975
Description: The interior of a subset of a topology's base set is the union of all the open sets it includes. Definition of interior of [Munkres] p. 94. (Contributed by NM, 10-Sep-2006.) (Revised by Mario Carneiro, 11-Nov-2013.)
Hypothesis
Ref Expression
iscld.1  |-  X  = 
U. J
Assertion
Ref Expression
ntrval  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( int `  J
) `  S )  =  U. ( J  i^i  ~P S ) )

Proof of Theorem ntrval
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 iscld.1 . . . . 5  |-  X  = 
U. J
21ntrfval 14965 . . . 4  |-  ( J  e.  Top  ->  ( int `  J )  =  ( x  e.  ~P X  |->  U. ( J  i^i  ~P x ) ) )
32fveq1d 5672 . . 3  |-  ( J  e.  Top  ->  (
( int `  J
) `  S )  =  ( ( x  e.  ~P X  |->  U. ( J  i^i  ~P x ) ) `  S ) )
43adantr 276 . 2  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( int `  J
) `  S )  =  ( ( x  e.  ~P X  |->  U. ( J  i^i  ~P x ) ) `  S ) )
5 eqid 2232 . . 3  |-  ( x  e.  ~P X  |->  U. ( J  i^i  ~P x ) )  =  ( x  e.  ~P X  |->  U. ( J  i^i  ~P x ) )
6 pweq 3672 . . . . 5  |-  ( x  =  S  ->  ~P x  =  ~P S
)
76ineq2d 3422 . . . 4  |-  ( x  =  S  ->  ( J  i^i  ~P x )  =  ( J  i^i  ~P S ) )
87unieqd 3925 . . 3  |-  ( x  =  S  ->  U. ( J  i^i  ~P x )  =  U. ( J  i^i  ~P S ) )
91topopn 14873 . . . . 5  |-  ( J  e.  Top  ->  X  e.  J )
10 elpw2g 4268 . . . . 5  |-  ( X  e.  J  ->  ( S  e.  ~P X  <->  S 
C_  X ) )
119, 10syl 14 . . . 4  |-  ( J  e.  Top  ->  ( S  e.  ~P X  <->  S 
C_  X ) )
1211biimpar 297 . . 3  |-  ( ( J  e.  Top  /\  S  C_  X )  ->  S  e.  ~P X
)
13 inex1g 4246 . . . . 5  |-  ( J  e.  Top  ->  ( J  i^i  ~P S )  e.  _V )
1413adantr 276 . . . 4  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( J  i^i  ~P S )  e.  _V )
15 uniexg 4560 . . . 4  |-  ( ( J  i^i  ~P S
)  e.  _V  ->  U. ( J  i^i  ~P S )  e.  _V )
1614, 15syl 14 . . 3  |-  ( ( J  e.  Top  /\  S  C_  X )  ->  U. ( J  i^i  ~P S )  e.  _V )
175, 8, 12, 16fvmptd3 5771 . 2  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( x  e. 
~P X  |->  U. ( J  i^i  ~P x ) ) `  S )  =  U. ( J  i^i  ~P S ) )
184, 17eqtrd 2265 1  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( int `  J
) `  S )  =  U. ( J  i^i  ~P S ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2203   _Vcvv 2813    i^i cin 3210    C_ wss 3211   ~Pcpw 3669   U.cuni 3914    |-> cmpt 4171   ` cfv 5352   Topctop 14862   intcnt 14958
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-top 14863  df-ntr 14961
This theorem is referenced by:  ntropn  14982  ntrss  14984  ntrss2  14986  ssntr  14987  isopn3  14990  ntreq0  14997
  Copyright terms: Public domain W3C validator