Theorem neiint 14868

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 14867	. . . 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 1043	. . 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 1191	. 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 541	. . . . 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 14845	. . . . . . 7 |- ( ( ( J e. Top /\ N C_ X ) /\ ( v e. J /\ v C_ N ) ) -> v C_ ( ( int ` J ) ` N ) )
7	6	3adantl2 1180	. . . . . 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 3237	. . . 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 2651	. . 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 1026	. . . . . 6 |- ( ( ( J e. Top /\ S C_ X /\ N C_ X ) /\ S C_ ( ( int ` J ) ` N ) ) -> J e. Top )
12		simpl3 1028	. . . . . 6 |- ( ( ( J e. Top /\ S C_ X /\ N C_ X ) /\ S C_ ( ( int ` J ) ` N ) ) -> N C_ X )
13	1	ntropn 14840	. . . . . 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 14844	. . . . . 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 3251	. . . . . . 7 |- ( v = ( ( int ` J ) ` N ) -> ( S C_ v <-> S C_ ( ( int ` J ) ` N ) ) )
19		sseq1 3250	. . . . . . 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 2910	. . . . 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 1271	. . . 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 1004   = wceq 1397   e. wcel 2202   E.wrex 2511   C_ wss 3200   U.cuni 3893   ` cfv 5326   Topctop 14720   intcnt 14816   neicnei 14861

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-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-top 14721  df-ntr 14819  df-nei 14862

This theorem is referenced by:  topssnei  14885  iscnp4  14941