Theorem neiint 13730

Description: An intuitive definition of a neighborhood in terms of interior. (Contributed by Szymon Jaroszewicz, 18-Dec-2007.) (Revised by Mario Carneiro, 11-Nov-2013.)

Hypothesis

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

Assertion

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

Proof of Theorem neiint

Dummy variable v is distinct from all other variables.

Step	Hyp	Ref	Expression
1		neifval.1	. . . . 5 |- X = U. J
2	1	isnei 13729	. . . 4 |- ( ( J e. Top /\ S C_ X ) -> ( N e. ( ( nei ` J ) ` S ) <-> ( N C_ X /\ E. v e. J ( S C_ v /\ v C_ N ) ) ) )
3	2	3adant3 1017	. . 3 |- ( ( J e. Top /\ S C_ X /\ N C_ X ) -> ( N e. ( ( nei ` J ) ` S ) <-> ( N C_ X /\ E. v e. J ( S C_ v /\ v C_ N ) ) ) )
4	3	3anibar 1165	. 2 |- ( ( J e. Top /\ S C_ X /\ N C_ X ) -> ( N e. ( ( nei ` J ) ` S ) <-> E. v e. J ( S C_ v /\ v C_ N ) ) )
5		simprrl 539	. . . . 5 |- ( ( ( J e. Top /\ S C_ X /\ N C_ X ) /\ ( v e. J /\ ( S C_ v /\ v C_ N ) ) ) -> S C_ v )
6	1	ssntr 13707	. . . . . . 7 |- ( ( ( J e. Top /\ N C_ X ) /\ ( v e. J /\ v C_ N ) ) -> v C_ ( ( int ` J ) ` N ) )
7	6	3adantl2 1154	. . . . . 6 |- ( ( ( J e. Top /\ S C_ X /\ N C_ X ) /\ ( v e. J /\ v C_ N ) ) -> v C_ ( ( int ` J ) ` N ) )
8	7	adantrrl 486	. . . . 5 |- ( ( ( J e. Top /\ S C_ X /\ N C_ X ) /\ ( v e. J /\ ( S C_ v /\ v C_ N ) ) ) -> v C_ ( ( int ` J ) ` N ) )
9	5, 8	sstrd 3167	. . . 4 |- ( ( ( J e. Top /\ S C_ X /\ N C_ X ) /\ ( v e. J /\ ( S C_ v /\ v C_ N ) ) ) -> S C_ ( ( int ` J ) ` N ) )
10	9	rexlimdvaa 2595	. . 3 |- ( ( J e. Top /\ S C_ X /\ N C_ X ) -> ( E. v e. J ( S C_ v /\ v C_ N ) -> S C_ ( ( int ` J ) ` N ) ) )
11		simpl1 1000	. . . . . 6 |- ( ( ( J e. Top /\ S C_ X /\ N C_ X ) /\ S C_ ( ( int ` J ) ` N ) ) -> J e. Top )
12		simpl3 1002	. . . . . 6 |- ( ( ( J e. Top /\ S C_ X /\ N C_ X ) /\ S C_ ( ( int ` J ) ` N ) ) -> N C_ X )
13	1	ntropn 13702	. . . . . 6 |- ( ( J e. Top /\ N C_ X ) -> ( ( int ` J ) ` N ) e. J )
14	11, 12, 13	syl2anc 411	. . . . 5 |- ( ( ( J e. Top /\ S C_ X /\ N C_ X ) /\ S C_ ( ( int ` J ) ` N ) ) -> ( ( int ` J ) ` N ) e. J )
15		simpr 110	. . . . 5 |- ( ( ( J e. Top /\ S C_ X /\ N C_ X ) /\ S C_ ( ( int ` J ) ` N ) ) -> S C_ ( ( int ` J ) ` N ) )
16	1	ntrss2 13706	. . . . . 6 |- ( ( J e. Top /\ N C_ X ) -> ( ( int ` J ) ` N ) C_ N )
17	11, 12, 16	syl2anc 411	. . . . 5 |- ( ( ( J e. Top /\ S C_ X /\ N C_ X ) /\ S C_ ( ( int ` J ) ` N ) ) -> ( ( int ` J ) ` N ) C_ N )
18		sseq2 3181	. . . . . . 7 |- ( v = ( ( int ` J ) ` N ) -> ( S C_ v <-> S C_ ( ( int ` J ) ` N ) ) )
19		sseq1 3180	. . . . . . 7 |- ( v = ( ( int ` J ) ` N ) -> ( v C_ N <-> ( ( int ` J ) ` N ) C_ N ) )
20	18, 19	anbi12d 473	. . . . . 6 |- ( v = ( ( int ` J ) ` N ) -> ( ( S C_ v /\ v C_ N ) <-> ( S C_ ( ( int ` J ) ` N ) /\ ( ( int ` J ) ` N ) C_ N ) ) )
21	20	rspcev 2843	. . . . 5 |- ( ( ( ( int ` J ) ` N ) e. J /\ ( S C_ ( ( int ` J ) ` N ) /\ ( ( int ` J ) ` N ) C_ N ) ) -> E. v e. J ( S C_ v /\ v C_ N ) )
22	14, 15, 17, 21	syl12anc 1236	. . . 4 |- ( ( ( J e. Top /\ S C_ X /\ N C_ X ) /\ S C_ ( ( int ` J ) ` N ) ) -> E. v e. J ( S C_ v /\ v C_ N ) )
23	22	ex 115	. . 3 |- ( ( J e. Top /\ S C_ X /\ N C_ X ) -> ( S C_ ( ( int ` J ) ` N ) -> E. v e. J ( S C_ v /\ v C_ N ) ) )
24	10, 23	impbid 129	. 2 |- ( ( J e. Top /\ S C_ X /\ N C_ X ) -> ( E. v e. J ( S C_ v /\ v C_ N ) <-> S C_ ( ( int ` J ) ` N ) ) )
25	4, 24	bitrd 188	1 |- ( ( J e. Top /\ S C_ X /\ N C_ X ) -> ( N e. ( ( nei ` J ) ` S ) <-> S C_ ( ( int ` J ) ` N ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 978   = wceq 1353   e. wcel 2148   E.wrex 2456   C_ wss 3131   U.cuni 3811   ` cfv 5218   Topctop 13582   intcnt 13678   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-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4120  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435

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-ntr 13681  df-nei 13724

This theorem is referenced by:  topssnei  13747  iscnp4  13803