Theorem neival 14896

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 14893	. . . 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 5644	. . 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 14761	. . . . 5 |- ( J e. Top -> X e. J )
6		elpw2g 4247	. . . . 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 4272	. . . . 5 |- ( X e. J -> ~P X e. _V )
10		rabexg 4234	. . . . 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 3249	. . . . . . 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 2532	. . . . 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 2790	. . . 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 2230	. . . 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 5725	. . 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 2263	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 1397   e. wcel 2201   E.wrex 2510   {crab 2513   _Vcvv 2801   C_ wss 3199   ~Pcpw 3653   U.cuni 3894   |-> cmpt 4151   ` cfv 5328   Topctop 14750   neicnei 14891

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2204  ax-ext 2212  ax-coll 4205  ax-sep 4208  ax-pow 4266  ax-pr 4301

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ral 2514  df-rex 2515  df-reu 2516  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-un 3203  df-in 3205  df-ss 3212  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-iun 3973  df-br 4090  df-opab 4152  df-mpt 4153  df-id 4392  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-ima 4740  df-iota 5288  df-fun 5330  df-fn 5331  df-f 5332  df-f1 5333  df-fo 5334  df-f1o 5335  df-fv 5336  df-top 14751  df-nei 14892

This theorem is referenced by:  isnei  14897