MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  neiss Unicode version

Theorem neiss 16862
Description: Any neighborhood of a set  S is also a neighborhood of any subset  R  C_  S. Theorem of [BourbakiTop1] p. I.2. (Contributed by FL, 25-Sep-2006.)
Assertion
Ref Expression
neiss  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  R  C_  S )  ->  N  e.  ( ( nei `  J
) `  R )
)

Proof of Theorem neiss
Dummy variable  g is distinct from all other variables.
StepHypRef Expression
1 eqid 2296 . . . 4  |-  U. J  =  U. J
21neii1 16859 . . 3  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  N  C_  U. J )
323adant3 975 . 2  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  R  C_  S )  ->  N  C_ 
U. J )
4 neii2 16861 . . . 4  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  E. g  e.  J  ( S  C_  g  /\  g  C_  N ) )
543adant3 975 . . 3  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  R  C_  S )  ->  E. g  e.  J  ( S  C_  g  /\  g  C_  N ) )
6 sstr2 3199 . . . . . 6  |-  ( R 
C_  S  ->  ( S  C_  g  ->  R  C_  g ) )
76anim1d 547 . . . . 5  |-  ( R 
C_  S  ->  (
( S  C_  g  /\  g  C_  N )  ->  ( R  C_  g  /\  g  C_  N
) ) )
87reximdv 2667 . . . 4  |-  ( R 
C_  S  ->  ( E. g  e.  J  ( S  C_  g  /\  g  C_  N )  ->  E. g  e.  J  ( R  C_  g  /\  g  C_  N ) ) )
983ad2ant3 978 . . 3  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  R  C_  S )  ->  ( E. g  e.  J  ( S  C_  g  /\  g  C_  N )  ->  E. g  e.  J  ( R  C_  g  /\  g  C_  N ) ) )
105, 9mpd 14 . 2  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  R  C_  S )  ->  E. g  e.  J  ( R  C_  g  /\  g  C_  N ) )
11 simp1 955 . . 3  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  R  C_  S )  ->  J  e.  Top )
12 simp3 957 . . . 4  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  R  C_  S )  ->  R  C_  S )
131neiss2 16854 . . . . 5  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  S  C_  U. J )
14133adant3 975 . . . 4  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  R  C_  S )  ->  S  C_ 
U. J )
1512, 14sstrd 3202 . . 3  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  R  C_  S )  ->  R  C_ 
U. J )
161isnei 16856 . . 3  |-  ( ( J  e.  Top  /\  R  C_  U. J )  ->  ( N  e.  ( ( nei `  J
) `  R )  <->  ( N  C_  U. J  /\  E. g  e.  J  ( R  C_  g  /\  g  C_  N ) ) ) )
1711, 15, 16syl2anc 642 . 2  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  R  C_  S )  ->  ( N  e.  ( ( nei `  J ) `  R )  <->  ( N  C_ 
U. J  /\  E. g  e.  J  ( R  C_  g  /\  g  C_  N ) ) ) )
183, 10, 17mpbir2and 888 1  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  R  C_  S )  ->  N  e.  ( ( nei `  J
) `  R )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    /\ w3a 934    e. wcel 1696   E.wrex 2557    C_ wss 3165   U.cuni 3843   ` cfv 5271   Topctop 16647   neicnei 16850
This theorem is referenced by:  neips  16866  neissex  16880
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-rep 4147  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-reu 2563  df-rab 2565  df-v 2803  df-sbc 3005  df-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-iun 3923  df-br 4040  df-opab 4094  df-mpt 4095  df-id 4325  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-top 16652  df-nei 16851
  Copyright terms: Public domain W3C validator