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

Theorem neifval 15005
Description: Value of the neighborhood function on the subsets of the base set of a topology. (Contributed by NM, 11-Feb-2007.) (Revised by Mario Carneiro, 11-Nov-2013.)
Hypothesis
Ref Expression
neifval.1  |-  X  = 
U. J
Assertion
Ref Expression
neifval  |-  ( J  e.  Top  ->  ( nei `  J )  =  ( x  e.  ~P X  |->  { v  e. 
~P X  |  E. g  e.  J  (
x  C_  g  /\  g  C_  v ) } ) )
Distinct variable groups:    v, g, x, J    g, X, v, x

Proof of Theorem neifval
Dummy variable  j is distinct from all other variables.
StepHypRef Expression
1 neifval.1 . . . 4  |-  X  = 
U. J
21topopn 14873 . . 3  |-  ( J  e.  Top  ->  X  e.  J )
3 pwexg 4293 . . 3  |-  ( X  e.  J  ->  ~P X  e.  _V )
4 mptexg 5911 . . 3  |-  ( ~P X  e.  _V  ->  ( x  e.  ~P X  |->  { v  e.  ~P X  |  E. g  e.  J  ( x  C_  g  /\  g  C_  v ) } )  e.  _V )
52, 3, 43syl 17 . 2  |-  ( J  e.  Top  ->  (
x  e.  ~P X  |->  { v  e.  ~P X  |  E. g  e.  J  ( x  C_  g  /\  g  C_  v ) } )  e.  _V )
6 unieq 3923 . . . . . 6  |-  ( j  =  J  ->  U. j  =  U. J )
76, 1eqtr4di 2283 . . . . 5  |-  ( j  =  J  ->  U. j  =  X )
87pweqd 3674 . . . 4  |-  ( j  =  J  ->  ~P U. j  =  ~P X
)
9 rexeq 2742 . . . . 5  |-  ( j  =  J  ->  ( E. g  e.  j 
( x  C_  g  /\  g  C_  v )  <->  E. g  e.  J  ( x  C_  g  /\  g  C_  v ) ) )
108, 9rabeqbidv 2808 . . . 4  |-  ( j  =  J  ->  { v  e.  ~P U. j  |  E. g  e.  j  ( x  C_  g  /\  g  C_  v ) }  =  { v  e.  ~P X  |  E. g  e.  J  ( x  C_  g  /\  g  C_  v ) } )
118, 10mpteq12dv 4192 . . 3  |-  ( j  =  J  ->  (
x  e.  ~P U. j  |->  { v  e. 
~P U. j  |  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 ) } ) )
12 df-nei 15004 . . 3  |-  nei  =  ( j  e.  Top  |->  ( x  e.  ~P U. j  |->  { v  e. 
~P U. j  |  E. g  e.  j  (
x  C_  g  /\  g  C_  v ) } ) )
1311, 12fvmptg 5753 . 2  |-  ( ( J  e.  Top  /\  ( x  e.  ~P X  |->  { v  e. 
~P X  |  E. g  e.  J  (
x  C_  g  /\  g  C_  v ) } )  e.  _V )  ->  ( nei `  J
)  =  ( x  e.  ~P X  |->  { v  e.  ~P X  |  E. g  e.  J  ( x  C_  g  /\  g  C_  v ) } ) )
145, 13mpdan 421 1  |-  ( J  e.  Top  ->  ( nei `  J )  =  ( x  e.  ~P X  |->  { v  e. 
~P X  |  E. g  e.  J  (
x  C_  g  /\  g  C_  v ) } ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2203   E.wrex 2521   {crab 2524   _Vcvv 2813    C_ wss 3211   ~Pcpw 3669   U.cuni 3914    |-> cmpt 4171   ` cfv 5352   Topctop 14862   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-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322
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-nei 15004
This theorem is referenced by:  neif  15006  neival  15008
  Copyright terms: Public domain W3C validator