ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  neiint Unicode version

Theorem neiint 15010
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.
StepHypRef Expression
1 neifval.1 . . . . 5  |-  X  = 
U. J
21isnei 15009 . . . 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 ) ) ) )
323adant3 1044 . . 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 ) ) ) )
433anibar 1192 . 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 )
61ssntr 14987 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  N  C_  X )  /\  ( v  e.  J  /\  v  C_  N ) )  ->  v  C_  ( ( int `  J
) `  N )
)
763adantl2 1181 . . . . . 6  |-  ( ( ( J  e.  Top  /\  S  C_  X  /\  N  C_  X )  /\  ( v  e.  J  /\  v  C_  N ) )  ->  v  C_  ( ( int `  J
) `  N )
)
87adantrrl 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 )
)
95, 8sstrd 3248 . . . 4  |-  ( ( ( J  e.  Top  /\  S  C_  X  /\  N  C_  X )  /\  ( v  e.  J  /\  ( S  C_  v  /\  v  C_  N ) ) )  ->  S  C_  ( ( int `  J
) `  N )
)
109rexlimdvaa 2661 . . 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 1027 . . . . . 6  |-  ( ( ( J  e.  Top  /\  S  C_  X  /\  N  C_  X )  /\  S  C_  ( ( int `  J ) `  N
) )  ->  J  e.  Top )
12 simpl3 1029 . . . . . 6  |-  ( ( ( J  e.  Top  /\  S  C_  X  /\  N  C_  X )  /\  S  C_  ( ( int `  J ) `  N
) )  ->  N  C_  X )
131ntropn 14982 . . . . . 6  |-  ( ( J  e.  Top  /\  N  C_  X )  -> 
( ( int `  J
) `  N )  e.  J )
1411, 12, 13syl2anc 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 )
)
161ntrss2 14986 . . . . . 6  |-  ( ( J  e.  Top  /\  N  C_  X )  -> 
( ( int `  J
) `  N )  C_  N )
1711, 12, 16syl2anc 411 . . . . 5  |-  ( ( ( J  e.  Top  /\  S  C_  X  /\  N  C_  X )  /\  S  C_  ( ( int `  J ) `  N
) )  ->  (
( int `  J
) `  N )  C_  N )
18 sseq2 3262 . . . . . . 7  |-  ( v  =  ( ( int `  J ) `  N
)  ->  ( S  C_  v  <->  S  C_  ( ( int `  J ) `
 N ) ) )
19 sseq1 3261 . . . . . . 7  |-  ( v  =  ( ( int `  J ) `  N
)  ->  ( v  C_  N  <->  ( ( int `  J ) `  N
)  C_  N )
)
2018, 19anbi12d 473 . . . . . 6  |-  ( v  =  ( ( int `  J ) `  N
)  ->  ( ( S  C_  v  /\  v  C_  N )  <->  ( S  C_  ( ( int `  J
) `  N )  /\  ( ( int `  J
) `  N )  C_  N ) ) )
2120rspcev 2921 . . . . 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 ) )
2214, 15, 17, 21syl12anc 1272 . . . 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 ) )
2322ex 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 ) ) )
2410, 23impbid 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 )
) )
254, 24bitrd 188 1  |-  ( ( J  e.  Top  /\  S  C_  X  /\  N  C_  X )  ->  ( N  e.  ( ( nei `  J ) `  S )  <->  S  C_  (
( int `  J
) `  N )
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1005    = wceq 1398    e. wcel 2203   E.wrex 2521    C_ wss 3211   U.cuni 3914   ` cfv 5352   Topctop 14862   intcnt 14958   neicnei 15003
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-top 14863  df-ntr 14961  df-nei 15004
This theorem is referenced by:  topssnei  15027  iscnp4  15083
  Copyright terms: Public domain W3C validator