Theorem innei 13330

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 2177	. . . . 5 |- U. J = U. J
2	1	neii1 13314	. . . 4 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) ) -> N C_ U. J )
3		ssinss1 3364	. . . 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 1017	. 2 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) /\ M e. ( ( nei ` J ) ` S ) ) -> ( N i^i M ) C_ U. J )
6		neii2 13316	. . . . 5 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) ) -> E. h e. J ( S C_ h /\ h C_ N ) )
7		neii2 13316	. . . . 5 |- ( ( J e. Top /\ M e. ( ( nei ` J ) ` S ) ) -> E. v e. J ( S C_ v /\ v C_ M ) )
8	6, 7	anim12dan 600	. . . 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 13168	. . . . . . . . . . 11 |- ( ( J e. Top /\ h e. J /\ v e. J ) -> ( h i^i v ) e. J )
10	9	3expa 1203	. . . . . . . . . 10 |- ( ( ( J e. Top /\ h e. J ) /\ v e. J ) -> ( h i^i v ) e. J )
11		ssin 3357	. . . . . . . . . . . . 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 3363	. . . . . . . . . . . 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 588	. . . . . . . . . 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 3179	. . . . . . . . . . . 12 |- ( g = ( h i^i v ) -> ( S C_ g <-> S C_ ( h i^i v ) ) )
17		sseq1 3178	. . . . . . . . . . . 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 2841	. . . . . . . . . 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 2594	. . . . . 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 2597	. . . . 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 1199	. 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 13309	. . . 4 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) ) -> S C_ U. J )
29	1	isnei 13311	. . . 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 1017	. 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 944	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 978   = wceq 1353   e. wcel 2148   E.wrex 2456   i^i cin 3128   C_ wss 3129   U.cuni 3807   ` cfv 5212   Topctop 13162   neicnei 13305

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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-coll 4115  ax-sep 4118  ax-pow 4171  ax-pr 4206

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-un 3133  df-in 3135  df-ss 3142  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-iun 3886  df-br 4001  df-opab 4062  df-mpt 4063  df-id 4290  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-iota 5174  df-fun 5214  df-fn 5215  df-f 5216  df-f1 5217  df-fo 5218  df-f1o 5219  df-fv 5220  df-top 13163  df-nei 13306

This theorem is referenced by: (None)