Theorem neiint 14313

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 14312	. . . 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 1019	. . 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 1167	. 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 14290	. . . . . . 7 |- ( ( ( J e. Top /\ N C_ X ) /\ ( v e. J /\ v C_ N ) ) -> v C_ ( ( int ` J ) ` N ) )
7	6	3adantl2 1156	. . . . . 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 3189	. . . 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 2612	. . 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 1002	. . . . . 6 |- ( ( ( J e. Top /\ S C_ X /\ N C_ X ) /\ S C_ ( ( int ` J ) ` N ) ) -> J e. Top )
12		simpl3 1004	. . . . . 6 |- ( ( ( J e. Top /\ S C_ X /\ N C_ X ) /\ S C_ ( ( int ` J ) ` N ) ) -> N C_ X )
13	1	ntropn 14285	. . . . . 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 14289	. . . . . 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 3203	. . . . . . 7 |- ( v = ( ( int ` J ) ` N ) -> ( S C_ v <-> S C_ ( ( int ` J ) ` N ) ) )
19		sseq1 3202	. . . . . . 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 2864	. . . . 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 1247	. . . 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 980   = wceq 1364   e. wcel 2164   E.wrex 2473   C_ wss 3153   U.cuni 3835   ` cfv 5254   Topctop 14165   intcnt 14261   neicnei 14306

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-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464

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 2986  df-csb 3081  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-top 14166  df-ntr 14264  df-nei 14307

This theorem is referenced by:  topssnei  14330  iscnp4  14386