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

Theorem neissex 14670
Description: For any neighborhood  N of  S, there is a neighborhood  x of  S such that  N is a neighborhood of all subsets of  x. Generalization to subsets of Property Viv of [BourbakiTop1] p. I.3. (Contributed by FL, 2-Oct-2006.)
Assertion
Ref Expression
neissex  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  E. x  e.  (
( nei `  J
) `  S ) A. y ( y  C_  x  ->  N  e.  ( ( nei `  J
) `  y )
) )
Distinct variable groups:    x, y, J   
x, N, y    x, S, y

Proof of Theorem neissex
StepHypRef Expression
1 neii2 14654 . 2  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  E. x  e.  J  ( S  C_  x  /\  x  C_  N ) )
2 opnneiss 14663 . . . . 5  |-  ( ( J  e.  Top  /\  x  e.  J  /\  S  C_  x )  ->  x  e.  ( ( nei `  J ) `  S ) )
323expb 1207 . . . 4  |-  ( ( J  e.  Top  /\  ( x  e.  J  /\  S  C_  x ) )  ->  x  e.  ( ( nei `  J
) `  S )
)
43adantrrr 487 . . 3  |-  ( ( J  e.  Top  /\  ( x  e.  J  /\  ( S  C_  x  /\  x  C_  N ) ) )  ->  x  e.  ( ( nei `  J
) `  S )
)
54adantlr 477 . 2  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  ( x  e.  J  /\  ( S 
C_  x  /\  x  C_  N ) ) )  ->  x  e.  ( ( nei `  J
) `  S )
)
6 simplll 533 . . . . . 6  |-  ( ( ( ( J  e. 
Top  /\  N  e.  ( ( nei `  J
) `  S )
)  /\  ( x  e.  J  /\  x  C_  N ) )  /\  y  C_  x )  ->  J  e.  Top )
7 simpll 527 . . . . . . . . . 10  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  x  e.  J
)  ->  J  e.  Top )
8 simpr 110 . . . . . . . . . 10  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  x  e.  J
)  ->  x  e.  J )
9 eqid 2205 . . . . . . . . . . . 12  |-  U. J  =  U. J
109neii1 14652 . . . . . . . . . . 11  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  N  C_  U. J )
1110adantr 276 . . . . . . . . . 10  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  x  e.  J
)  ->  N  C_  U. J
)
129opnssneib 14661 . . . . . . . . . 10  |-  ( ( J  e.  Top  /\  x  e.  J  /\  N  C_  U. J )  ->  ( x  C_  N 
<->  N  e.  ( ( nei `  J ) `
 x ) ) )
137, 8, 11, 12syl3anc 1250 . . . . . . . . 9  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  x  e.  J
)  ->  ( x  C_  N  <->  N  e.  (
( nei `  J
) `  x )
) )
1413biimpa 296 . . . . . . . 8  |-  ( ( ( ( J  e. 
Top  /\  N  e.  ( ( nei `  J
) `  S )
)  /\  x  e.  J )  /\  x  C_  N )  ->  N  e.  ( ( nei `  J
) `  x )
)
1514anasss 399 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  ( x  e.  J  /\  x  C_  N ) )  ->  N  e.  ( ( nei `  J ) `  x ) )
1615adantr 276 . . . . . 6  |-  ( ( ( ( J  e. 
Top  /\  N  e.  ( ( nei `  J
) `  S )
)  /\  ( x  e.  J  /\  x  C_  N ) )  /\  y  C_  x )  ->  N  e.  ( ( nei `  J ) `  x ) )
17 simpr 110 . . . . . 6  |-  ( ( ( ( J  e. 
Top  /\  N  e.  ( ( nei `  J
) `  S )
)  /\  ( x  e.  J  /\  x  C_  N ) )  /\  y  C_  x )  -> 
y  C_  x )
18 neiss 14655 . . . . . 6  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  x )  /\  y  C_  x )  ->  N  e.  ( ( nei `  J
) `  y )
)
196, 16, 17, 18syl3anc 1250 . . . . 5  |-  ( ( ( ( J  e. 
Top  /\  N  e.  ( ( nei `  J
) `  S )
)  /\  ( x  e.  J  /\  x  C_  N ) )  /\  y  C_  x )  ->  N  e.  ( ( nei `  J ) `  y ) )
2019ex 115 . . . 4  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  ( x  e.  J  /\  x  C_  N ) )  -> 
( y  C_  x  ->  N  e.  ( ( nei `  J ) `
 y ) ) )
2120adantrrl 486 . . 3  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  ( x  e.  J  /\  ( S 
C_  x  /\  x  C_  N ) ) )  ->  ( y  C_  x  ->  N  e.  ( ( nei `  J
) `  y )
) )
2221alrimiv 1897 . 2  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  ( x  e.  J  /\  ( S 
C_  x  /\  x  C_  N ) ) )  ->  A. y ( y 
C_  x  ->  N  e.  ( ( nei `  J
) `  y )
) )
231, 5, 22reximssdv 2610 1  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  E. x  e.  (
( nei `  J
) `  S ) A. y ( y  C_  x  ->  N  e.  ( ( nei `  J
) `  y )
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105   A.wal 1371    e. wcel 2176   E.wrex 2485    C_ wss 3166   U.cuni 3850   ` cfv 5272   Topctop 14502   neicnei 14643
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-14 2179  ax-ext 2187  ax-coll 4160  ax-sep 4163  ax-pow 4219  ax-pr 4254
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-reu 2491  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-iun 3929  df-br 4046  df-opab 4107  df-mpt 4108  df-id 4341  df-xp 4682  df-rel 4683  df-cnv 4684  df-co 4685  df-dm 4686  df-rn 4687  df-res 4688  df-ima 4689  df-iota 5233  df-fun 5274  df-fn 5275  df-f 5276  df-f1 5277  df-fo 5278  df-f1o 5279  df-fv 5280  df-top 14503  df-nei 14644
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator