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

Theorem neiss2 15243
Description: A set with a neighborhood is a subset of the base set of a topology. (This theorem depends on a function's value being empty outside of its domain, but it will make later theorems simpler to state.) (Contributed by NM, 12-Feb-2007.)
Hypothesis
Ref Expression
neifval.1  |-  X  = 
U. J
Assertion
Ref Expression
neiss2  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  S  C_  X )

Proof of Theorem neiss2
StepHypRef Expression
1 neifval.1 . . . . . 6  |-  X  = 
U. J
21neif 15242 . . . . 5  |-  ( J  e.  Top  ->  ( nei `  J )  Fn 
~P X )
3 fnrel 5479 . . . . 5  |-  ( ( nei `  J )  Fn  ~P X  ->  Rel  ( nei `  J
) )
42, 3syl 14 . . . 4  |-  ( J  e.  Top  ->  Rel  ( nei `  J ) )
5 relelfvdm 5727 . . . 4  |-  ( ( Rel  ( nei `  J
)  /\  N  e.  ( ( nei `  J
) `  S )
)  ->  S  e.  dom  ( nei `  J
) )
64, 5sylan 283 . . 3  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  S  e.  dom  ( nei `  J ) )
7 fndm 5480 . . . . . 6  |-  ( ( nei `  J )  Fn  ~P X  ->  dom  ( nei `  J
)  =  ~P X
)
82, 7syl 14 . . . . 5  |-  ( J  e.  Top  ->  dom  ( nei `  J )  =  ~P X )
98eleq2d 2308 . . . 4  |-  ( J  e.  Top  ->  ( S  e.  dom  ( nei `  J )  <->  S  e.  ~P X ) )
109adantr 276 . . 3  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  -> 
( S  e.  dom  ( nei `  J )  <-> 
S  e.  ~P X
) )
116, 10mpbid 147 . 2  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  S  e.  ~P X
)
1211elpwid 3700 1  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  S  C_  X )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209    C_ wss 3220   ~Pcpw 3688   U.cuni 3935   dom cdm 4774   Rel wrel 4779    Fn wfn 5372   ` cfv 5377   Topctop 15098   neicnei 15239
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 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346
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 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-top 15099  df-nei 15240
This theorem is used by:  neii1  15248  neii2  15250  neiss  15251  ssnei2  15258  topssnei  15263  innei  15264  neitx  15369
  Copyright terms: Public domain W3C validator