Theorem neiss 15251

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.

Step	Hyp	Ref	Expression
1		eqid 2238	. . . 4 |- U. J = U. J
2	1	neii1 15248	. . 3 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) ) -> N C_ U. J )
3	2	3adant3 1048	. 2 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) /\ R C_ S ) -> N C_ U. J )
4		neii2 15250	. . . 4 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) ) -> E. g e. J ( S C_ g /\ g C_ N ) )
5	4	3adant3 1048	. . 3 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) /\ R C_ S ) -> E. g e. J ( S C_ g /\ g C_ N ) )
6		sstr2 3255	. . . . . 6 |- ( R C_ S -> ( S C_ g -> R C_ g ) )
7	6	anim1d 336	. . . . 5 |- ( R C_ S -> ( ( S C_ g /\ g C_ N ) -> ( R C_ g /\ g C_ N ) ) )
8	7	reximdv 2651	. . . 4 |- ( R C_ S -> ( E. g e. J ( S C_ g /\ g C_ N ) -> E. g e. J ( R C_ g /\ g C_ N ) ) )
9	8	3ad2ant3 1051	. . 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 ) ) )
10	5, 9	mpd 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 1028	. . 3 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) /\ R C_ S ) -> J e. Top )
12		simp3 1030	. . . 4 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) /\ R C_ S ) -> R C_ S )
13	1	neiss2 15243	. . . . 5 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) ) -> S C_ U. J )
14	13	3adant3 1048	. . . 4 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) /\ R C_ S ) -> S C_ U. J )
15	12, 14	sstrd 3258	. . 3 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) /\ R C_ S ) -> R C_ U. J )
16	1	isnei 15245	. . 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 ) ) ) )
17	11, 15, 16	syl2anc 415	. 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 ) ) ) )
18	3, 10, 17	mpbir2and 957	1 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) /\ R C_ S ) -> N e. ( ( nei ` J ) ` R ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   e. wcel 2209   E.wrex 2529   C_ wss 3220   U.cuni 3935   ` cfv 5377   Topctop 15098   neicnei 15239

This proof depends on 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 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof 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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-top 15099  df-nei 15240

This theorem is used by:  neipsm  15255  neissex  15266