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

Theorem ssnei2 12326
Description: Any subset  M of  X containing a neighborhood  N of a set  S is a neighborhood of this set. Generalization to subsets of Property Vi of [BourbakiTop1] p. I.3. (Contributed by FL, 2-Oct-2006.)
Hypothesis
Ref Expression
neips.1  |-  X  = 
U. J
Assertion
Ref Expression
ssnei2  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  ( N  C_  M  /\  M  C_  X
) )  ->  M  e.  ( ( nei `  J
) `  S )
)

Proof of Theorem ssnei2
Dummy variable  g is distinct from all other variables.
StepHypRef Expression
1 simprr 521 . 2  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  ( N  C_  M  /\  M  C_  X
) )  ->  M  C_  X )
2 neii2 12318 . . . 4  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  E. g  e.  J  ( S  C_  g  /\  g  C_  N ) )
3 sstr2 3104 . . . . . . 7  |-  ( g 
C_  N  ->  ( N  C_  M  ->  g  C_  M ) )
43com12 30 . . . . . 6  |-  ( N 
C_  M  ->  (
g  C_  N  ->  g 
C_  M ) )
54anim2d 335 . . . . 5  |-  ( N 
C_  M  ->  (
( S  C_  g  /\  g  C_  N )  ->  ( S  C_  g  /\  g  C_  M
) ) )
65reximdv 2533 . . . 4  |-  ( N 
C_  M  ->  ( E. g  e.  J  ( S  C_  g  /\  g  C_  N )  ->  E. g  e.  J  ( S  C_  g  /\  g  C_  M ) ) )
72, 6mpan9 279 . . 3  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  N  C_  M
)  ->  E. g  e.  J  ( S  C_  g  /\  g  C_  M ) )
87adantrr 470 . 2  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  ( N  C_  M  /\  M  C_  X
) )  ->  E. g  e.  J  ( S  C_  g  /\  g  C_  M ) )
9 neips.1 . . . . 5  |-  X  = 
U. J
109neiss2 12311 . . . 4  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  S  C_  X )
119isnei 12313 . . . 4  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( M  e.  ( ( nei `  J
) `  S )  <->  ( M  C_  X  /\  E. g  e.  J  ( S  C_  g  /\  g  C_  M ) ) ) )
1210, 11syldan 280 . . 3  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  -> 
( M  e.  ( ( nei `  J
) `  S )  <->  ( M  C_  X  /\  E. g  e.  J  ( S  C_  g  /\  g  C_  M ) ) ) )
1312adantr 274 . 2  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  ( N  C_  M  /\  M  C_  X
) )  ->  ( M  e.  ( ( nei `  J ) `  S )  <->  ( M  C_  X  /\  E. g  e.  J  ( S  C_  g  /\  g  C_  M ) ) ) )
141, 8, 13mpbir2and 928 1  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  ( N  C_  M  /\  M  C_  X
) )  ->  M  e.  ( ( nei `  J
) `  S )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1331    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:  topssnei  12331
  Copyright terms: Public domain W3C validator