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

Theorem opnneiid 15390
Description: Only an open set is a neighborhood of itself. (Contributed by FL, 2-Oct-2006.)
Assertion
Ref Expression
opnneiid  |-  ( J  e.  Top  ->  ( N  e.  ( ( nei `  J ) `  N )  <->  N  e.  J ) )

Proof of Theorem opnneiid
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 neii2 15375 . . . 4  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  N ) )  ->  E. x  e.  J  ( N  C_  x  /\  x  C_  N ) )
2 eqss 3263 . . . . . 6  |-  ( N  =  x  <->  ( N  C_  x  /\  x  C_  N ) )
3 eleq1a 2310 . . . . . 6  |-  ( x  e.  J  ->  ( N  =  x  ->  N  e.  J ) )
42, 3biimtrrid 153 . . . . 5  |-  ( x  e.  J  ->  (
( N  C_  x  /\  x  C_  N )  ->  N  e.  J
) )
54rexlimiv 2662 . . . 4  |-  ( E. x  e.  J  ( N  C_  x  /\  x  C_  N )  ->  N  e.  J )
61, 5syl 14 . . 3  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  N ) )  ->  N  e.  J )
76ex 115 . 2  |-  ( J  e.  Top  ->  ( N  e.  ( ( nei `  J ) `  N )  ->  N  e.  J ) )
8 ssid 3268 . . 3  |-  N  C_  N
9 opnneiss 15384 . . . 4  |-  ( ( J  e.  Top  /\  N  e.  J  /\  N  C_  N )  ->  N  e.  ( ( nei `  J ) `  N ) )
1093exp 1233 . . 3  |-  ( J  e.  Top  ->  ( N  e.  J  ->  ( N  C_  N  ->  N  e.  ( ( nei `  J ) `  N
) ) ) )
118, 10mpii 44 . 2  |-  ( J  e.  Top  ->  ( N  e.  J  ->  N  e.  ( ( nei `  J ) `  N
) ) )
127, 11impbid 129 1  |-  ( J  e.  Top  ->  ( N  e.  ( ( nei `  J ) `  N )  <->  N  e.  J ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   E.wrex 2529    C_ wss 3220   ` cfv 5380   Topctop 15223   neicnei 15364
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-top 15224  df-nei 15365
This theorem is used by:  0nei  15392
  Copyright terms: Public domain W3C validator