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

Theorem neival 14857
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 14854 . . . 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 5637 . . 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 14722 . . . . 5  |-  ( J  e.  Top  ->  X  e.  J )
6 elpw2g 4244 . . . . 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 4268 . . . . 5  |-  ( X  e.  J  ->  ~P X  e.  _V )
10 rabexg 4231 . . . . 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 3248 . . . . . . 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 2531 . . . . 5  |-  ( x  =  S  ->  ( E. g  e.  J  ( x  C_  g  /\  g  C_  v )  <->  E. g  e.  J  ( S  C_  g  /\  g  C_  v ) ) )
1615rabbidv 2789 . . . 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 2229 . . . 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 5718 . . 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 2262 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 1395    e. wcel 2200   E.wrex 2509   {crab 2512   _Vcvv 2800    C_ wss 3198   ~Pcpw 3650   U.cuni 3891    |-> cmpt 4148   ` cfv 5324   Topctop 14711   neicnei 14852
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-pow 4262  ax-pr 4297
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-top 14712  df-nei 14853
This theorem is referenced by:  isnei  14858
  Copyright terms: Public domain W3C validator