Theorem innei 15187

Description: The intersection of two neighborhoods of a set is also a neighborhood of the set. Generalization to subsets of Property V_ii of [BourbakiTop1] p. I.3 for binary intersections. (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.

Step	Hyp	Ref	Expression
1		eqid 2238	. . . . 5 |- U. J = U. J
2	1	neii1 15171	. . . 4 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) ) -> N C_ U. J )
3		ssinss1 3460	. . . 4 |- ( N C_ U. J -> ( N i^i M ) C_ U. J )
4	2, 3	syl 14	. . 3 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) ) -> ( N i^i M ) C_ U. J )
5	4	3adant3 1048	. 2 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) /\ M e. ( ( nei ` J ) ` S ) ) -> ( N i^i M ) C_ U. J )
6		neii2 15173	. . . . 5 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) ) -> E. h e. J ( S C_ h /\ h C_ N ) )
7		neii2 15173	. . . . 5 |- ( ( J e. Top /\ M e. ( ( nei ` J ) ` S ) ) -> E. v e. J ( S C_ v /\ v C_ M ) )
8	6, 7	anim12dan 608	. . . 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 15027	. . . . . . . . . . 11 |- ( ( J e. Top /\ h e. J /\ v e. J ) -> ( h i^i v ) e. J )
10	9	3expa 1234	. . . . . . . . . 10 |- ( ( ( J e. Top /\ h e. J ) /\ v e. J ) -> ( h i^i v ) e. J )
11		ssin 3453	. . . . . . . . . . . . 13 |- ( ( S C_ h /\ S C_ v ) <-> S C_ ( h i^i v ) )
12	11	biimpi 120	. . . . . . . . . . . 12 |- ( ( S C_ h /\ S C_ v ) -> S C_ ( h i^i v ) )
13		ss2in 3459	. . . . . . . . . . . 12 |- ( ( h C_ N /\ v C_ M ) -> ( h i^i v ) C_ ( N i^i M ) )
14	12, 13	anim12i 338	. . . . . . . . . . 11 |- ( ( ( 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 ) ) )
15	14	an4s 596	. . . . . . . . . 10 |- ( ( ( 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 3272	. . . . . . . . . . . 12 |- ( g = ( h i^i v ) -> ( S C_ g <-> S C_ ( h i^i v ) ) )
17		sseq1 3271	. . . . . . . . . . . 12 |- ( g = ( h i^i v ) -> ( g C_ ( N i^i M ) <-> ( h i^i v ) C_ ( N i^i M ) ) )
18	16, 17	anbi12d 477	. . . . . . . . . . 11 |- ( 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 ) ) ) )
19	18	rspcev 2929	. . . . . . . . . 10 |- ( ( ( 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 ) ) )
20	10, 15, 19	syl2an 289	. . . . . . . . 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 ) ) )
21	20	expr 375	. . . . . . . 8 |- ( ( ( ( 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 ) ) ) )
22	21	an32s 574	. . . . . . 7 |- ( ( ( ( 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 ) ) ) )
23	22	rexlimdva 2668	. . . . . 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 ) ) ) )
24	23	rexlimdva2 2671	. . . . 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 ) ) ) ) )
25	24	imp32 257	. . . 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 ) ) )
26	8, 25	syldan 282	. . 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 ) ) )
27	26	3impb 1230	. 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 ) ) )
28	1	neiss2 15166	. . . 4 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) ) -> S C_ U. J )
29	1	isnei 15168	. . . 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 ) ) ) ) )
30	28, 29	syldan 282	. . 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 ) ) ) ) )
31	30	3adant3 1048	. 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 ) ) ) ) )
32	5, 27, 31	mpbir2and 957	1 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) /\ M e. ( ( nei ` J ) ` S ) ) -> ( N i^i M ) e. ( ( nei ` J ) ` S ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   = wceq 1402   e. wcel 2209   E.wrex 2529   i^i cin 3219   C_ wss 3220   U.cuni 3930   ` cfv 5372   Topctop 15021   neicnei 15162

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

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-nei 15163

This theorem is referenced by: (None)