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

Theorem neiint 12939
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 12938 . . . 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 1012 . . 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 1160 . 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 534 . . . . 5  |-  ( ( ( J  e.  Top  /\  S  C_  X  /\  N  C_  X )  /\  ( v  e.  J  /\  ( S  C_  v  /\  v  C_  N ) ) )  ->  S  C_  v )
61ssntr 12916 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  N  C_  X )  /\  ( v  e.  J  /\  v  C_  N ) )  ->  v  C_  ( ( int `  J
) `  N )
)
763adantl2 1149 . . . . . 6  |-  ( ( ( J  e.  Top  /\  S  C_  X  /\  N  C_  X )  /\  ( v  e.  J  /\  v  C_  N ) )  ->  v  C_  ( ( int `  J
) `  N )
)
87adantrrl 483 . . . . 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 3157 . . . 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 2588 . . 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 995 . . . . . 6  |-  ( ( ( J  e.  Top  /\  S  C_  X  /\  N  C_  X )  /\  S  C_  ( ( int `  J ) `  N
) )  ->  J  e.  Top )
12 simpl3 997 . . . . . 6  |-  ( ( ( J  e.  Top  /\  S  C_  X  /\  N  C_  X )  /\  S  C_  ( ( int `  J ) `  N
) )  ->  N  C_  X )
131ntropn 12911 . . . . . 6  |-  ( ( J  e.  Top  /\  N  C_  X )  -> 
( ( int `  J
) `  N )  e.  J )
1411, 12, 13syl2anc 409 . . . . 5  |-  ( ( ( J  e.  Top  /\  S  C_  X  /\  N  C_  X )  /\  S  C_  ( ( int `  J ) `  N
) )  ->  (
( int `  J
) `  N )  e.  J )
15 simpr 109 . . . . 5  |-  ( ( ( J  e.  Top  /\  S  C_  X  /\  N  C_  X )  /\  S  C_  ( ( int `  J ) `  N
) )  ->  S  C_  ( ( int `  J
) `  N )
)
161ntrss2 12915 . . . . . 6  |-  ( ( J  e.  Top  /\  N  C_  X )  -> 
( ( int `  J
) `  N )  C_  N )
1711, 12, 16syl2anc 409 . . . . 5  |-  ( ( ( J  e.  Top  /\  S  C_  X  /\  N  C_  X )  /\  S  C_  ( ( int `  J ) `  N
) )  ->  (
( int `  J
) `  N )  C_  N )
18 sseq2 3171 . . . . . . 7  |-  ( v  =  ( ( int `  J ) `  N
)  ->  ( S  C_  v  <->  S  C_  ( ( int `  J ) `
 N ) ) )
19 sseq1 3170 . . . . . . 7  |-  ( v  =  ( ( int `  J ) `  N
)  ->  ( v  C_  N  <->  ( ( int `  J ) `  N
)  C_  N )
)
2018, 19anbi12d 470 . . . . . 6  |-  ( v  =  ( ( int `  J ) `  N
)  ->  ( ( S  C_  v  /\  v  C_  N )  <->  ( S  C_  ( ( int `  J
) `  N )  /\  ( ( int `  J
) `  N )  C_  N ) ) )
2120rspcev 2834 . . . . 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 1231 . . . 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 114 . . 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 128 . 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 187 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 103    <-> wb 104    /\ w3a 973    = wceq 1348    e. wcel 2141   E.wrex 2449    C_ wss 3121   U.cuni 3796   ` cfv 5198   Topctop 12789   intcnt 12887   neicnei 12932
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4104  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-reu 2455  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-top 12790  df-ntr 12890  df-nei 12933
This theorem is referenced by:  topssnei  12956  iscnp4  13012
  Copyright terms: Public domain W3C validator