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

Theorem isnei 14812
Description: The predicate "the class  N is a neighborhood of  S". (Contributed by FL, 25-Sep-2006.) (Revised by Mario Carneiro, 11-Nov-2013.)
Hypothesis
Ref Expression
neifval.1  |-  X  = 
U. J
Assertion
Ref Expression
isnei  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( N  e.  ( ( nei `  J
) `  S )  <->  ( N  C_  X  /\  E. g  e.  J  ( S  C_  g  /\  g  C_  N ) ) ) )
Distinct variable groups:    g, J    g, N    S, g    g, X

Proof of Theorem isnei
Dummy variable  v is distinct from all other variables.
StepHypRef Expression
1 neifval.1 . . . 4  |-  X  = 
U. J
21neival 14811 . . 3  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( nei `  J
) `  S )  =  { v  e.  ~P X  |  E. g  e.  J  ( S  C_  g  /\  g  C_  v ) } )
32eleq2d 2299 . 2  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( N  e.  ( ( nei `  J
) `  S )  <->  N  e.  { v  e. 
~P X  |  E. g  e.  J  ( S  C_  g  /\  g  C_  v ) } ) )
4 sseq2 3248 . . . . . . 7  |-  ( v  =  N  ->  (
g  C_  v  <->  g  C_  N ) )
54anbi2d 464 . . . . . 6  |-  ( v  =  N  ->  (
( S  C_  g  /\  g  C_  v )  <-> 
( S  C_  g  /\  g  C_  N ) ) )
65rexbidv 2531 . . . . 5  |-  ( v  =  N  ->  ( E. g  e.  J  ( S  C_  g  /\  g  C_  v )  <->  E. g  e.  J  ( S  C_  g  /\  g  C_  N ) ) )
76elrab 2959 . . . 4  |-  ( N  e.  { v  e. 
~P X  |  E. g  e.  J  ( S  C_  g  /\  g  C_  v ) }  <->  ( N  e.  ~P X  /\  E. g  e.  J  ( S  C_  g  /\  g  C_  N ) ) )
81topopn 14676 . . . . . 6  |-  ( J  e.  Top  ->  X  e.  J )
9 elpw2g 4239 . . . . . 6  |-  ( X  e.  J  ->  ( N  e.  ~P X  <->  N 
C_  X ) )
108, 9syl 14 . . . . 5  |-  ( J  e.  Top  ->  ( N  e.  ~P X  <->  N 
C_  X ) )
1110anbi1d 465 . . . 4  |-  ( J  e.  Top  ->  (
( N  e.  ~P X  /\  E. g  e.  J  ( S  C_  g  /\  g  C_  N
) )  <->  ( N  C_  X  /\  E. g  e.  J  ( S  C_  g  /\  g  C_  N ) ) ) )
127, 11bitrid 192 . . 3  |-  ( J  e.  Top  ->  ( N  e.  { v  e.  ~P X  |  E. g  e.  J  ( S  C_  g  /\  g  C_  v ) }  <->  ( N  C_  X  /\  E. g  e.  J  ( S  C_  g  /\  g  C_  N ) ) ) )
1312adantr 276 . 2  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( N  e.  {
v  e.  ~P X  |  E. g  e.  J  ( S  C_  g  /\  g  C_  v ) }  <-> 
( N  C_  X  /\  E. g  e.  J  ( S  C_  g  /\  g  C_  N ) ) ) )
143, 13bitrd 188 1  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( N  e.  ( ( nei `  J
) `  S )  <->  ( N  C_  X  /\  E. g  e.  J  ( S  C_  g  /\  g  C_  N ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1395    e. wcel 2200   E.wrex 2509   {crab 2512    C_ wss 3197   ~Pcpw 3649   U.cuni 3887   ` cfv 5317   Topctop 14665   neicnei 14806
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 4198  ax-sep 4201  ax-pow 4257  ax-pr 4292
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 2801  df-sbc 3029  df-csb 3125  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-top 14666  df-nei 14807
This theorem is referenced by:  neiint  14813  isneip  14814  neii1  14815  neii2  14817  neiss  14818  neipsm  14822  opnneissb  14823  opnssneib  14824  ssnei2  14825  innei  14831  neitx  14936
  Copyright terms: Public domain W3C validator