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

Theorem neif 15242
Description: The neighborhood function is a function from the set of the subsets of the base set of a topology. (Contributed by NM, 12-Feb-2007.) (Revised by Mario Carneiro, 11-Nov-2013.)
Hypothesis
Ref Expression
neifval.1  |-  X  = 
U. J
Assertion
Ref Expression
neif  |-  ( J  e.  Top  ->  ( nei `  J )  Fn 
~P X )

Proof of Theorem neif
Dummy variables  g  v  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 neifval.1 . . . . . 6  |-  X  = 
U. J
21topopn 15109 . . . . 5  |-  ( J  e.  Top  ->  X  e.  J )
3 pwexg 4317 . . . . 5  |-  ( X  e.  J  ->  ~P X  e.  _V )
4 rabexg 4279 . . . . 5  |-  ( ~P X  e.  _V  ->  { v  e.  ~P X  |  E. g  e.  J  ( x  C_  g  /\  g  C_  v ) }  e.  _V )
52, 3, 43syl 17 . . . 4  |-  ( J  e.  Top  ->  { v  e.  ~P X  |  E. g  e.  J  ( x  C_  g  /\  g  C_  v ) }  e.  _V )
65ralrimivw 2624 . . 3  |-  ( J  e.  Top  ->  A. x  e.  ~P  X { v  e.  ~P X  |  E. g  e.  J  ( x  C_  g  /\  g  C_  v ) }  e.  _V )
7 eqid 2238 . . . 4  |-  ( x  e.  ~P X  |->  { v  e.  ~P X  |  E. g  e.  J  ( x  C_  g  /\  g  C_  v ) } )  =  ( x  e.  ~P X  |->  { v  e.  ~P X  |  E. g  e.  J  ( x  C_  g  /\  g  C_  v ) } )
87fnmpt 5510 . . 3  |-  ( A. x  e.  ~P  X { v  e.  ~P X  |  E. g  e.  J  ( x  C_  g  /\  g  C_  v ) }  e.  _V  ->  ( x  e. 
~P X  |->  { v  e.  ~P X  |  E. g  e.  J  ( x  C_  g  /\  g  C_  v ) } )  Fn  ~P X
)
96, 8syl 14 . 2  |-  ( J  e.  Top  ->  (
x  e.  ~P X  |->  { v  e.  ~P X  |  E. g  e.  J  ( x  C_  g  /\  g  C_  v ) } )  Fn  ~P X )
101neifval 15241 . . 3  |-  ( J  e.  Top  ->  ( nei `  J )  =  ( x  e.  ~P X  |->  { v  e. 
~P X  |  E. g  e.  J  (
x  C_  g  /\  g  C_  v ) } ) )
1110fneq1d 5471 . 2  |-  ( J  e.  Top  ->  (
( nei `  J
)  Fn  ~P X  <->  ( x  e.  ~P X  |->  { v  e.  ~P X  |  E. g  e.  J  ( x  C_  g  /\  g  C_  v ) } )  Fn  ~P X ) )
129, 11mpbird 167 1  |-  ( J  e.  Top  ->  ( nei `  J )  Fn 
~P X )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   A.wral 2528   E.wrex 2529   {crab 2532   _Vcvv 2821    C_ wss 3220   ~Pcpw 3688   U.cuni 3935    |-> cmpt 4192    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:  neiss2  15243
  Copyright terms: Public domain W3C validator