Theorem innei 14877

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 2229	. . . . 5 |- U. J = U. J
2	1	neii1 14861	. . . 4 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) ) -> N C_ U. J )
3		ssinss1 3434	. . . 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 1041	. 2 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) /\ M e. ( ( nei ` J ) ` S ) ) -> ( N i^i M ) C_ U. J )
6		neii2 14863	. . . . 5 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) ) -> E. h e. J ( S C_ h /\ h C_ N ) )
7		neii2 14863	. . . . 5 |- ( ( J e. Top /\ M e. ( ( nei ` J ) ` S ) ) -> E. v e. J ( S C_ v /\ v C_ M ) )
8	6, 7	anim12dan 602	. . . 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 14717	. . . . . . . . . . 11 |- ( ( J e. Top /\ h e. J /\ v e. J ) -> ( h i^i v ) e. J )
10	9	3expa 1227	. . . . . . . . . 10 |- ( ( ( J e. Top /\ h e. J ) /\ v e. J ) -> ( h i^i v ) e. J )
11		ssin 3427	. . . . . . . . . . . . 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 3433	. . . . . . . . . . . 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 590	. . . . . . . . . 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 3249	. . . . . . . . . . . 12 |- ( g = ( h i^i v ) -> ( S C_ g <-> S C_ ( h i^i v ) ) )
17		sseq1 3248	. . . . . . . . . . . 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 473	. . . . . . . . . . 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 2908	. . . . . . . . . 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 568	. . . . . . 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 2648	. . . . . 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 2651	. . . . 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 1223	. 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 14856	. . . 4 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) ) -> S C_ U. J )
29	1	isnei 14858	. . . 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 1041	. 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 950	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 1002   = wceq 1395   e. wcel 2200   E.wrex 2509   i^i cin 3197   C_ wss 3198   U.cuni 3891   ` cfv 5324   Topctop 14711   neicnei 14852

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-pow 4262  ax-pr 4297

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-top 14712  df-nei 14853

This theorem is referenced by: (None)