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

Theorem ntrval 15134
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 15124 . . . 4  |-  ( J  e.  Top  ->  ( int `  J )  =  ( x  e.  ~P X  |->  U. ( J  i^i  ~P x ) ) )
32fveq1d 5692 . . 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 2238 . . 3  |-  ( x  e.  ~P X  |->  U. ( J  i^i  ~P x ) )  =  ( x  e.  ~P X  |->  U. ( J  i^i  ~P x ) )
6 pweq 3688 . . . . 5  |-  ( x  =  S  ->  ~P x  =  ~P S
)
76ineq2d 3432 . . . 4  |-  ( x  =  S  ->  ( J  i^i  ~P x )  =  ( J  i^i  ~P S ) )
87unieqd 3941 . . 3  |-  ( x  =  S  ->  U. ( J  i^i  ~P x )  =  U. ( J  i^i  ~P S ) )
91topopn 15032 . . . . 5  |-  ( J  e.  Top  ->  X  e.  J )
10 elpw2g 4287 . . . . 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 4264 . . . . 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 4580 . . . 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 5793 . 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 2271 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 1402    e. wcel 2209   _Vcvv 2821    i^i cin 3219    C_ wss 3220   ~Pcpw 3685   U.cuni 3930    |-> cmpt 4187   ` cfv 5372   Topctop 15021   intcnt 15117
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 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-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-top 15022  df-ntr 15120
This theorem is referenced by:  ntropn  15141  ntrss  15143  ntrss2  15145  ssntr  15146  isopn3  15149  ntreq0  15156
  Copyright terms: Public domain W3C validator