MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  isnei Structured version   Visualization version   Unicode version

Theorem isnei 20907
Description: The predicate " 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 20906 . . 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 2687 . 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 3627 . . . . . . 7  |-  ( v  =  N  ->  (
g  C_  v  <->  g  C_  N ) )
54anbi2d 740 . . . . . 6  |-  ( v  =  N  ->  (
( S  C_  g  /\  g  C_  v )  <-> 
( S  C_  g  /\  g  C_  N ) ) )
65rexbidv 3052 . . . . 5  |-  ( v  =  N  ->  ( E. g  e.  J  ( S  C_  g  /\  g  C_  v )  <->  E. g  e.  J  ( S  C_  g  /\  g  C_  N ) ) )
76elrab 3363 . . . 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 20711 . . . . . 6  |-  ( J  e.  Top  ->  X  e.  J )
9 elpw2g 4827 . . . . . 6  |-  ( X  e.  J  ->  ( N  e.  ~P X  <->  N 
C_  X ) )
108, 9syl 17 . . . . 5  |-  ( J  e.  Top  ->  ( N  e.  ~P X  <->  N 
C_  X ) )
1110anbi1d 741 . . . 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, 11syl5bb 272 . . 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 481 . 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 268 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 setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    = wceq 1483    e. wcel 1990   E.wrex 2913   {crab 2916    C_ wss 3574   ~Pcpw 4158   U.cuni 4436   ` cfv 5888   Topctop 20698   neicnei 20901
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-top 20699  df-nei 20902
This theorem is referenced by:  neiint  20908  isneip  20909  neii1  20910  neii2  20912  neiss  20913  neips  20917  opnneissb  20918  opnssneib  20919  ssnei2  20920  innei  20929  neitr  20984  neitx  21410  neifg  32366  islptre  39851
  Copyright terms: Public domain W3C validator