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

Theorem neissex 12334
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 12318 . 2  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  E. x  e.  J  ( S  C_  x  /\  x  C_  N ) )
2 opnneiss 12327 . . . . 5  |-  ( ( J  e.  Top  /\  x  e.  J  /\  S  C_  x )  ->  x  e.  ( ( nei `  J ) `  S ) )
323expb 1182 . . . 4  |-  ( ( J  e.  Top  /\  ( x  e.  J  /\  S  C_  x ) )  ->  x  e.  ( ( nei `  J
) `  S )
)
43adantrrr 478 . . 3  |-  ( ( J  e.  Top  /\  ( x  e.  J  /\  ( S  C_  x  /\  x  C_  N ) ) )  ->  x  e.  ( ( nei `  J
) `  S )
)
54adantlr 468 . 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 522 . . . . . 6  |-  ( ( ( ( J  e. 
Top  /\  N  e.  ( ( nei `  J
) `  S )
)  /\  ( x  e.  J  /\  x  C_  N ) )  /\  y  C_  x )  ->  J  e.  Top )
7 simpll 518 . . . . . . . . . 10  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  x  e.  J
)  ->  J  e.  Top )
8 simpr 109 . . . . . . . . . 10  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  x  e.  J
)  ->  x  e.  J )
9 eqid 2139 . . . . . . . . . . . 12  |-  U. J  =  U. J
109neii1 12316 . . . . . . . . . . 11  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  N  C_  U. J )
1110adantr 274 . . . . . . . . . 10  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  x  e.  J
)  ->  N  C_  U. J
)
129opnssneib 12325 . . . . . . . . . 10  |-  ( ( J  e.  Top  /\  x  e.  J  /\  N  C_  U. J )  ->  ( x  C_  N 
<->  N  e.  ( ( nei `  J ) `
 x ) ) )
137, 8, 11, 12syl3anc 1216 . . . . . . . . 9  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  x  e.  J
)  ->  ( x  C_  N  <->  N  e.  (
( nei `  J
) `  x )
) )
1413biimpa 294 . . . . . . . 8  |-  ( ( ( ( J  e. 
Top  /\  N  e.  ( ( nei `  J
) `  S )
)  /\  x  e.  J )  /\  x  C_  N )  ->  N  e.  ( ( nei `  J
) `  x )
)
1514anasss 396 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  ( x  e.  J  /\  x  C_  N ) )  ->  N  e.  ( ( nei `  J ) `  x ) )
1615adantr 274 . . . . . 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 109 . . . . . 6  |-  ( ( ( ( J  e. 
Top  /\  N  e.  ( ( nei `  J
) `  S )
)  /\  ( x  e.  J  /\  x  C_  N ) )  /\  y  C_  x )  -> 
y  C_  x )
18 neiss 12319 . . . . . 6  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  x )  /\  y  C_  x )  ->  N  e.  ( ( nei `  J
) `  y )
)
196, 16, 17, 18syl3anc 1216 . . . . 5  |-  ( ( ( ( J  e. 
Top  /\  N  e.  ( ( nei `  J
) `  S )
)  /\  ( x  e.  J  /\  x  C_  N ) )  /\  y  C_  x )  ->  N  e.  ( ( nei `  J ) `  y ) )
2019ex 114 . . . 4  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  ( x  e.  J  /\  x  C_  N ) )  -> 
( y  C_  x  ->  N  e.  ( ( nei `  J ) `
 y ) ) )
2120adantrrl 477 . . 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 1846 . 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 2536 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 103    <-> wb 104   A.wal 1329    e. wcel 1480   E.wrex 2417    C_ wss 3071   U.cuni 3736   ` cfv 5123   Topctop 12164   neicnei 12307
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-pow 4098  ax-pr 4131
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-top 12165  df-nei 12308
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator