Theorem opnneissb 14334

Description: An open set is a neighborhood of any of its subsets. (Contributed by FL, 2-Oct-2006.)

Hypothesis

Ref	Expression
neips.1	|- X = U. J

Assertion

Ref	Expression
opnneissb	|- ( ( J e. Top /\ N e. J /\ S C_ X ) -> ( S C_ N <-> N e. ( ( nei ` J ) ` S ) ) )

Proof of Theorem opnneissb

Dummy variable g is distinct from all other variables.

Step	Hyp	Ref	Expression
1		neips.1	. . . . . . 7 |- X = U. J
2	1	eltopss 14188	. . . . . 6 |- ( ( J e. Top /\ N e. J ) -> N C_ X )
3	2	adantr 276	. . . . 5 |- ( ( ( J e. Top /\ N e. J ) /\ ( S C_ X /\ S C_ N ) ) -> N C_ X )
4		ssid 3200	. . . . . . 7 |- N C_ N
5		sseq2 3204	. . . . . . . . 9 |- ( g = N -> ( S C_ g <-> S C_ N ) )
6		sseq1 3203	. . . . . . . . 9 |- ( g = N -> ( g C_ N <-> N C_ N ) )
7	5, 6	anbi12d 473	. . . . . . . 8 |- ( g = N -> ( ( S C_ g /\ g C_ N ) <-> ( S C_ N /\ N C_ N ) ) )
8	7	rspcev 2865	. . . . . . 7 |- ( ( N e. J /\ ( S C_ N /\ N C_ N ) ) -> E. g e. J ( S C_ g /\ g C_ N ) )
9	4, 8	mpanr2 438	. . . . . 6 |- ( ( N e. J /\ S C_ N ) -> E. g e. J ( S C_ g /\ g C_ N ) )
10	9	ad2ant2l 508	. . . . 5 |- ( ( ( J e. Top /\ N e. J ) /\ ( S C_ X /\ S C_ N ) ) -> E. g e. J ( S C_ g /\ g C_ N ) )
11	1	isnei 14323	. . . . . 6 |- ( ( J e. Top /\ S C_ X ) -> ( N e. ( ( nei ` J ) ` S ) <-> ( N C_ X /\ E. g e. J ( S C_ g /\ g C_ N ) ) ) )
12	11	ad2ant2r 509	. . . . 5 |- ( ( ( J e. Top /\ N e. J ) /\ ( S C_ X /\ S C_ N ) ) -> ( N e. ( ( nei ` J ) ` S ) <-> ( N C_ X /\ E. g e. J ( S C_ g /\ g C_ N ) ) ) )
13	3, 10, 12	mpbir2and 946	. . . 4 |- ( ( ( J e. Top /\ N e. J ) /\ ( S C_ X /\ S C_ N ) ) -> N e. ( ( nei ` J ) ` S ) )
14	13	exp43 372	. . 3 |- ( J e. Top -> ( N e. J -> ( S C_ X -> ( S C_ N -> N e. ( ( nei ` J ) ` S ) ) ) ) )
15	14	3imp 1195	. 2 |- ( ( J e. Top /\ N e. J /\ S C_ X ) -> ( S C_ N -> N e. ( ( nei ` J ) ` S ) ) )
16		ssnei 14330	. . . 4 |- ( ( J e. Top /\ N e. ( ( nei ` J ) ` S ) ) -> S C_ N )
17	16	ex 115	. . 3 |- ( J e. Top -> ( N e. ( ( nei ` J ) ` S ) -> S C_ N ) )
18	17	3ad2ant1 1020	. 2 |- ( ( J e. Top /\ N e. J /\ S C_ X ) -> ( N e. ( ( nei ` J ) ` S ) -> S C_ N ) )
19	15, 18	impbid 129	1 |- ( ( J e. Top /\ N e. J /\ S C_ X ) -> ( S C_ N <-> N e. ( ( nei ` J ) ` S ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 980   = wceq 1364   e. wcel 2164   E.wrex 2473   C_ wss 3154   U.cuni 3836   ` cfv 5255   Topctop 14176   neicnei 14317

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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-pow 4204  ax-pr 4239

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-top 14177  df-nei 14318

This theorem is referenced by:  opnneiss  14337