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

Theorem neiss 14329
Description: Any neighborhood of a set  S is also a neighborhood of any subset  R  C_  S. Similar to Proposition 1 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 2193 . . . 4  |-  U. J  =  U. J
21neii1 14326 . . 3  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  N  C_  U. J )
323adant3 1019 . 2  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  R  C_  S )  ->  N  C_ 
U. J )
4 neii2 14328 . . . 4  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  E. g  e.  J  ( S  C_  g  /\  g  C_  N ) )
543adant3 1019 . . 3  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  R  C_  S )  ->  E. g  e.  J  ( S  C_  g  /\  g  C_  N ) )
6 sstr2 3187 . . . . . 6  |-  ( R 
C_  S  ->  ( S  C_  g  ->  R  C_  g ) )
76anim1d 336 . . . . 5  |-  ( R 
C_  S  ->  (
( S  C_  g  /\  g  C_  N )  ->  ( R  C_  g  /\  g  C_  N
) ) )
87reximdv 2595 . . . 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 1022 . . 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 13 . 2  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  R  C_  S )  ->  E. g  e.  J  ( R  C_  g  /\  g  C_  N ) )
11 simp1 999 . . 3  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  R  C_  S )  ->  J  e.  Top )
12 simp3 1001 . . . 4  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  R  C_  S )  ->  R  C_  S )
131neiss2 14321 . . . . 5  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  S  C_  U. J )
14133adant3 1019 . . . 4  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  R  C_  S )  ->  S  C_ 
U. J )
1512, 14sstrd 3190 . . 3  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  R  C_  S )  ->  R  C_ 
U. J )
161isnei 14323 . . 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 411 . 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 946 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    /\ wa 104    <-> wb 105    /\ w3a 980    e. wcel 2164   E.wrex 2473    C_ wss 3154   U.cuni 3836   ` cfv 5255   Topctop 14176   neicnei 14317
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-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-pow 4204  ax-pr 4239
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-top 14177  df-nei 14318
This theorem is referenced by:  neipsm  14333  neissex  14344
  Copyright terms: Public domain W3C validator