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

Theorem neival 14869
Description: Value of the set of neighborhoods of a subset 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
neival  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( nei `  J
) `  S )  =  { v  e.  ~P X  |  E. g  e.  J  ( S  C_  g  /\  g  C_  v ) } )
Distinct variable groups:    v, g, J    S, g, v    g, X, v

Proof of Theorem neival
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 neifval.1 . . . . 5  |-  X  = 
U. J
21neifval 14866 . . . 4  |-  ( J  e.  Top  ->  ( nei `  J )  =  ( x  e.  ~P X  |->  { v  e. 
~P X  |  E. g  e.  J  (
x  C_  g  /\  g  C_  v ) } ) )
32fveq1d 5641 . . 3  |-  ( J  e.  Top  ->  (
( nei `  J
) `  S )  =  ( ( x  e.  ~P X  |->  { v  e.  ~P X  |  E. g  e.  J  ( x  C_  g  /\  g  C_  v ) } ) `  S ) )
43adantr 276 . 2  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( nei `  J
) `  S )  =  ( ( x  e.  ~P X  |->  { v  e.  ~P X  |  E. g  e.  J  ( x  C_  g  /\  g  C_  v ) } ) `  S ) )
51topopn 14734 . . . . 5  |-  ( J  e.  Top  ->  X  e.  J )
6 elpw2g 4246 . . . . 5  |-  ( X  e.  J  ->  ( S  e.  ~P X  <->  S 
C_  X ) )
75, 6syl 14 . . . 4  |-  ( J  e.  Top  ->  ( S  e.  ~P X  <->  S 
C_  X ) )
87biimpar 297 . . 3  |-  ( ( J  e.  Top  /\  S  C_  X )  ->  S  e.  ~P X
)
9 pwexg 4270 . . . . 5  |-  ( X  e.  J  ->  ~P X  e.  _V )
10 rabexg 4233 . . . . 5  |-  ( ~P X  e.  _V  ->  { v  e.  ~P X  |  E. g  e.  J  ( S  C_  g  /\  g  C_  v ) }  e.  _V )
115, 9, 103syl 17 . . . 4  |-  ( J  e.  Top  ->  { v  e.  ~P X  |  E. g  e.  J  ( S  C_  g  /\  g  C_  v ) }  e.  _V )
1211adantr 276 . . 3  |-  ( ( J  e.  Top  /\  S  C_  X )  ->  { v  e.  ~P X  |  E. g  e.  J  ( S  C_  g  /\  g  C_  v ) }  e.  _V )
13 sseq1 3250 . . . . . . 7  |-  ( x  =  S  ->  (
x  C_  g  <->  S  C_  g
) )
1413anbi1d 465 . . . . . 6  |-  ( x  =  S  ->  (
( x  C_  g  /\  g  C_  v )  <-> 
( S  C_  g  /\  g  C_  v ) ) )
1514rexbidv 2533 . . . . 5  |-  ( x  =  S  ->  ( E. g  e.  J  ( x  C_  g  /\  g  C_  v )  <->  E. g  e.  J  ( S  C_  g  /\  g  C_  v ) ) )
1615rabbidv 2791 . . . 4  |-  ( x  =  S  ->  { v  e.  ~P X  |  E. g  e.  J  ( x  C_  g  /\  g  C_  v ) }  =  { v  e. 
~P X  |  E. g  e.  J  ( S  C_  g  /\  g  C_  v ) } )
17 eqid 2231 . . . 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 ) } )
1816, 17fvmptg 5722 . . 3  |-  ( ( S  e.  ~P X  /\  { v  e.  ~P X  |  E. g  e.  J  ( S  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 ) } ) `
 S )  =  { v  e.  ~P X  |  E. g  e.  J  ( S  C_  g  /\  g  C_  v ) } )
198, 12, 18syl2anc 411 . 2  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( x  e. 
~P X  |->  { v  e.  ~P X  |  E. g  e.  J  ( x  C_  g  /\  g  C_  v ) } ) `  S )  =  { v  e. 
~P X  |  E. g  e.  J  ( S  C_  g  /\  g  C_  v ) } )
204, 19eqtrd 2264 1  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( nei `  J
) `  S )  =  { v  e.  ~P X  |  E. g  e.  J  ( S  C_  g  /\  g  C_  v ) } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1397    e. wcel 2202   E.wrex 2511   {crab 2514   _Vcvv 2802    C_ wss 3200   ~Pcpw 3652   U.cuni 3893    |-> cmpt 4150   ` cfv 5326   Topctop 14723   neicnei 14864
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-top 14724  df-nei 14865
This theorem is referenced by:  isnei  14870
  Copyright terms: Public domain W3C validator