Theorem neival 13728

Description: Value of the set of neighborhoods of a subset of the base set of a topology. (Contributed by NM, 11-Feb-2007.) (Revised by Mario Carneiro, 11-Nov-2013.)

Hypothesis

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

Assertion

Ref	Expression
neival	|- ( ( J e. Top /\ S C_ X ) -> ( ( nei ` J ) ` S ) = { v e. ~P X | E. g e. J ( S C_ g /\ g C_ v ) } )

Distinct variable groups:   v, g, J   S, g, v   g, X, v

Proof of Theorem neival

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		neifval.1	. . . . 5 |- X = U. J
2	1	neifval 13725	. . . 4 |- ( J e. Top -> ( nei ` J ) = ( x e. ~P X |-> { v e. ~P X | E. g e. J ( x C_ g /\ g C_ v ) } ) )
3	2	fveq1d 5519	. . 3 |- ( J e. Top -> ( ( nei ` J ) ` S ) = ( ( x e. ~P X |-> { v e. ~P X | E. g e. J ( x C_ g /\ g C_ v ) } ) ` S ) )
4	3	adantr 276	. 2 |- ( ( J e. Top /\ S C_ X ) -> ( ( nei ` J ) ` S ) = ( ( x e. ~P X |-> { v e. ~P X | E. g e. J ( x C_ g /\ g C_ v ) } ) ` S ) )
5	1	topopn 13593	. . . . 5 |- ( J e. Top -> X e. J )
6		elpw2g 4158	. . . . 5 |- ( X e. J -> ( S e. ~P X <-> S C_ X ) )
7	5, 6	syl 14	. . . 4 |- ( J e. Top -> ( S e. ~P X <-> S C_ X ) )
8	7	biimpar 297	. . 3 |- ( ( J e. Top /\ S C_ X ) -> S e. ~P X )
9		pwexg 4182	. . . . 5 |- ( X e. J -> ~P X e. _V )
10		rabexg 4148	. . . . 5 |- ( ~P X e. _V -> { v e. ~P X | E. g e. J ( S C_ g /\ g C_ v ) } e. _V )
11	5, 9, 10	3syl 17	. . . 4 |- ( J e. Top -> { v e. ~P X | E. g e. J ( S C_ g /\ g C_ v ) } e. _V )
12	11	adantr 276	. . 3 |- ( ( J e. Top /\ S C_ X ) -> { v e. ~P X | E. g e. J ( S C_ g /\ g C_ v ) } e. _V )
13		sseq1 3180	. . . . . . 7 |- ( x = S -> ( x C_ g <-> S C_ g ) )
14	13	anbi1d 465	. . . . . 6 |- ( x = S -> ( ( x C_ g /\ g C_ v ) <-> ( S C_ g /\ g C_ v ) ) )
15	14	rexbidv 2478	. . . . 5 |- ( x = S -> ( E. g e. J ( x C_ g /\ g C_ v ) <-> E. g e. J ( S C_ g /\ g C_ v ) ) )
16	15	rabbidv 2728	. . . 4 |- ( x = S -> { v e. ~P X | E. g e. J ( x C_ g /\ g C_ v ) } = { v e. ~P X | E. g e. J ( S C_ g /\ g C_ v ) } )
17		eqid 2177	. . . 4 |- ( x e. ~P X |-> { v e. ~P X | E. g e. J ( x C_ g /\ g C_ v ) } ) = ( x e. ~P X |-> { v e. ~P X | E. g e. J ( x C_ g /\ g C_ v ) } )
18	16, 17	fvmptg 5594	. . 3 |- ( ( S e. ~P X /\ { v e. ~P X | E. g e. J ( S C_ g /\ g C_ v ) } e. _V ) -> ( ( x e. ~P X |-> { v e. ~P X | E. g e. J ( x C_ g /\ g C_ v ) } ) ` S ) = { v e. ~P X | E. g e. J ( S C_ g /\ g C_ v ) } )
19	8, 12, 18	syl2anc 411	. 2 |- ( ( J e. Top /\ S C_ X ) -> ( ( x e. ~P X |-> { v e. ~P X | E. g e. J ( x C_ g /\ g C_ v ) } ) ` S ) = { v e. ~P X | E. g e. J ( S C_ g /\ g C_ v ) } )
20	4, 19	eqtrd 2210	1 |- ( ( J e. Top /\ S C_ X ) -> ( ( nei ` J ) ` S ) = { v e. ~P X | E. g e. J ( S C_ g /\ g C_ v ) } )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1353   e. wcel 2148   E.wrex 2456   {crab 2459   _Vcvv 2739   C_ wss 3131   ~Pcpw 3577   U.cuni 3811   |-> cmpt 4066   ` cfv 5218   Topctop 13582   neicnei 13723

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 4120  ax-sep 4123  ax-pow 4176  ax-pr 4211

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 2741  df-sbc 2965  df-csb 3060  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-top 13583  df-nei 13724

This theorem is referenced by:  isnei  13729