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

Theorem innei 16858
Description: The intersection of two neighborhoods of a set is also a neighborhood of the set. Proposition Vii of [BourbakiTop1] p. I.3 . (Contributed by FL, 28-Sep-2006.)
Assertion
Ref Expression
innei  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  M  e.  ( ( nei `  J
) `  S )
)  ->  ( N  i^i  M )  e.  ( ( nei `  J
) `  S )
)

Proof of Theorem innei
Dummy variables  g  h  v are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2284 . . . . 5  |-  U. J  =  U. J
21neii1 16839 . . . 4  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  N  C_  U. J )
3 ssinss1 3398 . . . 4  |-  ( N 
C_  U. J  ->  ( N  i^i  M )  C_  U. J )
42, 3syl 15 . . 3  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  -> 
( N  i^i  M
)  C_  U. J )
543adant3 975 . 2  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  M  e.  ( ( nei `  J
) `  S )
)  ->  ( N  i^i  M )  C_  U. J
)
6 neii2 16841 . . . . 5  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  E. h  e.  J  ( S  C_  h  /\  h  C_  N ) )
7 neii2 16841 . . . . 5  |-  ( ( J  e.  Top  /\  M  e.  ( ( nei `  J ) `  S ) )  ->  E. v  e.  J  ( S  C_  v  /\  v  C_  M ) )
86, 7anim12dan 810 . . . 4  |-  ( ( J  e.  Top  /\  ( N  e.  (
( nei `  J
) `  S )  /\  M  e.  (
( nei `  J
) `  S )
) )  ->  ( E. h  e.  J  ( S  C_  h  /\  h  C_  N )  /\  E. v  e.  J  ( S  C_  v  /\  v  C_  M ) ) )
9 inopn 16641 . . . . . . . . . . . 12  |-  ( ( J  e.  Top  /\  h  e.  J  /\  v  e.  J )  ->  ( h  i^i  v
)  e.  J )
1093expa 1151 . . . . . . . . . . 11  |-  ( ( ( J  e.  Top  /\  h  e.  J )  /\  v  e.  J
)  ->  ( h  i^i  v )  e.  J
)
11 ssin 3392 . . . . . . . . . . . . . 14  |-  ( ( S  C_  h  /\  S  C_  v )  <->  S  C_  (
h  i^i  v )
)
1211biimpi 186 . . . . . . . . . . . . 13  |-  ( ( S  C_  h  /\  S  C_  v )  ->  S  C_  ( h  i^i  v ) )
13 ss2in 3397 . . . . . . . . . . . . 13  |-  ( ( h  C_  N  /\  v  C_  M )  -> 
( h  i^i  v
)  C_  ( N  i^i  M ) )
1412, 13anim12i 549 . . . . . . . . . . . 12  |-  ( ( ( S  C_  h  /\  S  C_  v )  /\  ( h  C_  N  /\  v  C_  M
) )  ->  ( S  C_  ( h  i^i  v )  /\  (
h  i^i  v )  C_  ( N  i^i  M
) ) )
1514an4s 799 . . . . . . . . . . 11  |-  ( ( ( S  C_  h  /\  h  C_  N )  /\  ( S  C_  v  /\  v  C_  M
) )  ->  ( S  C_  ( h  i^i  v )  /\  (
h  i^i  v )  C_  ( N  i^i  M
) ) )
16 sseq2 3201 . . . . . . . . . . . . 13  |-  ( g  =  ( h  i^i  v )  ->  ( S  C_  g  <->  S  C_  (
h  i^i  v )
) )
17 sseq1 3200 . . . . . . . . . . . . 13  |-  ( g  =  ( h  i^i  v )  ->  (
g  C_  ( N  i^i  M )  <->  ( h  i^i  v )  C_  ( N  i^i  M ) ) )
1816, 17anbi12d 691 . . . . . . . . . . . 12  |-  ( g  =  ( h  i^i  v )  ->  (
( S  C_  g  /\  g  C_  ( N  i^i  M ) )  <-> 
( S  C_  (
h  i^i  v )  /\  ( h  i^i  v
)  C_  ( N  i^i  M ) ) ) )
1918rspcev 2885 . . . . . . . . . . 11  |-  ( ( ( h  i^i  v
)  e.  J  /\  ( S  C_  ( h  i^i  v )  /\  ( h  i^i  v
)  C_  ( N  i^i  M ) ) )  ->  E. g  e.  J  ( S  C_  g  /\  g  C_  ( N  i^i  M ) ) )
2010, 15, 19syl2an 463 . . . . . . . . . 10  |-  ( ( ( ( J  e. 
Top  /\  h  e.  J )  /\  v  e.  J )  /\  (
( S  C_  h  /\  h  C_  N )  /\  ( S  C_  v  /\  v  C_  M
) ) )  ->  E. g  e.  J  ( S  C_  g  /\  g  C_  ( N  i^i  M ) ) )
2120expr 598 . . . . . . . . 9  |-  ( ( ( ( J  e. 
Top  /\  h  e.  J )  /\  v  e.  J )  /\  ( S  C_  h  /\  h  C_  N ) )  -> 
( ( S  C_  v  /\  v  C_  M
)  ->  E. g  e.  J  ( S  C_  g  /\  g  C_  ( N  i^i  M ) ) ) )
2221an32s 779 . . . . . . . 8  |-  ( ( ( ( J  e. 
Top  /\  h  e.  J )  /\  ( S  C_  h  /\  h  C_  N ) )  /\  v  e.  J )  ->  ( ( S  C_  v  /\  v  C_  M
)  ->  E. g  e.  J  ( S  C_  g  /\  g  C_  ( N  i^i  M ) ) ) )
2322rexlimdva 2668 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  h  e.  J )  /\  ( S  C_  h  /\  h  C_  N
) )  ->  ( E. v  e.  J  ( S  C_  v  /\  v  C_  M )  ->  E. g  e.  J  ( S  C_  g  /\  g  C_  ( N  i^i  M ) ) ) )
2423ex 423 . . . . . 6  |-  ( ( J  e.  Top  /\  h  e.  J )  ->  ( ( S  C_  h  /\  h  C_  N
)  ->  ( E. v  e.  J  ( S  C_  v  /\  v  C_  M )  ->  E. g  e.  J  ( S  C_  g  /\  g  C_  ( N  i^i  M ) ) ) ) )
2524rexlimdva 2668 . . . . 5  |-  ( J  e.  Top  ->  ( E. h  e.  J  ( S  C_  h  /\  h  C_  N )  -> 
( E. v  e.  J  ( S  C_  v  /\  v  C_  M
)  ->  E. g  e.  J  ( S  C_  g  /\  g  C_  ( N  i^i  M ) ) ) ) )
2625imp32 422 . . . 4  |-  ( ( J  e.  Top  /\  ( E. h  e.  J  ( S  C_  h  /\  h  C_  N )  /\  E. v  e.  J  ( S  C_  v  /\  v  C_  M ) ) )  ->  E. g  e.  J  ( S  C_  g  /\  g  C_  ( N  i^i  M ) ) )
278, 26syldan 456 . . 3  |-  ( ( J  e.  Top  /\  ( N  e.  (
( nei `  J
) `  S )  /\  M  e.  (
( nei `  J
) `  S )
) )  ->  E. g  e.  J  ( S  C_  g  /\  g  C_  ( N  i^i  M ) ) )
28273impb 1147 . 2  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  M  e.  ( ( nei `  J
) `  S )
)  ->  E. g  e.  J  ( S  C_  g  /\  g  C_  ( N  i^i  M ) ) )
291neiss2 16834 . . . 4  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  S  C_  U. J )
301isnei 16836 . . . 4  |-  ( ( J  e.  Top  /\  S  C_  U. J )  ->  ( ( N  i^i  M )  e.  ( ( nei `  J
) `  S )  <->  ( ( N  i^i  M
)  C_  U. J  /\  E. g  e.  J  ( S  C_  g  /\  g  C_  ( N  i^i  M ) ) ) ) )
3129, 30syldan 456 . . 3  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  -> 
( ( N  i^i  M )  e.  ( ( nei `  J ) `
 S )  <->  ( ( N  i^i  M )  C_  U. J  /\  E. g  e.  J  ( S  C_  g  /\  g  C_  ( N  i^i  M ) ) ) ) )
32313adant3 975 . 2  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  M  e.  ( ( nei `  J
) `  S )
)  ->  ( ( N  i^i  M )  e.  ( ( nei `  J
) `  S )  <->  ( ( N  i^i  M
)  C_  U. J  /\  E. g  e.  J  ( S  C_  g  /\  g  C_  ( N  i^i  M ) ) ) ) )
335, 28, 32mpbir2and 888 1  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S )  /\  M  e.  ( ( nei `  J
) `  S )
)  ->  ( N  i^i  M )  e.  ( ( nei `  J
) `  S )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    /\ w3a 934    = wceq 1623    e. wcel 1685   E.wrex 2545    i^i cin 3152    C_ wss 3153   U.cuni 3828   ` cfv 5221   Topctop 16627   neicnei 16830
This theorem is referenced by:  neifil  17571  islimrs4  24993  neificl  25878
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1636  ax-8 1644  ax-13 1687  ax-14 1689  ax-6 1704  ax-7 1709  ax-11 1716  ax-12 1868  ax-ext 2265  ax-rep 4132  ax-sep 4142  ax-nul 4150  ax-pow 4187  ax-pr 4213  ax-un 4511
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1631  df-eu 2148  df-mo 2149  df-clab 2271  df-cleq 2277  df-clel 2280  df-nfc 2409  df-ne 2449  df-ral 2549  df-rex 2550  df-reu 2551  df-rab 2553  df-v 2791  df-sbc 2993  df-csb 3083  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3457  df-if 3567  df-pw 3628  df-sn 3647  df-pr 3648  df-op 3650  df-uni 3829  df-iun 3908  df-br 4025  df-opab 4079  df-mpt 4080  df-id 4308  df-xp 4694  df-rel 4695  df-cnv 4696  df-co 4697  df-dm 4698  df-rn 4699  df-res 4700  df-ima 4701  df-fun 5223  df-fn 5224  df-f 5225  df-f1 5226  df-fo 5227  df-f1o 5228  df-fv 5229  df-top 16632  df-nei 16831
  Copyright terms: Public domain W3C validator