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

Theorem ssnei2 13237
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 531 . 2  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  ( N  C_  M  /\  M  C_  X
) )  ->  M  C_  X )
2 neii2 13229 . . . 4  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  E. g  e.  J  ( S  C_  g  /\  g  C_  N ) )
3 sstr2 3160 . . . . . . 7  |-  ( g 
C_  N  ->  ( N  C_  M  ->  g  C_  M ) )
43com12 30 . . . . . 6  |-  ( N 
C_  M  ->  (
g  C_  N  ->  g 
C_  M ) )
54anim2d 337 . . . . 5  |-  ( N 
C_  M  ->  (
( S  C_  g  /\  g  C_  N )  ->  ( S  C_  g  /\  g  C_  M
) ) )
65reximdv 2576 . . . 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 281 . . 3  |-  ( ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `
 S ) )  /\  N  C_  M
)  ->  E. g  e.  J  ( S  C_  g  /\  g  C_  M ) )
87adantrr 479 . 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 13222 . . . 4  |-  ( ( J  e.  Top  /\  N  e.  ( ( nei `  J ) `  S ) )  ->  S  C_  X )
119isnei 13224 . . . 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 282 . . 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 276 . 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 944 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 104    <-> wb 105    = wceq 1353    e. wcel 2146   E.wrex 2454    C_ wss 3127   U.cuni 3805   ` cfv 5208   Topctop 13075   neicnei 13218
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 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-14 2149  ax-ext 2157  ax-coll 4113  ax-sep 4116  ax-pow 4169  ax-pr 4203
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1459  df-sb 1761  df-eu 2027  df-mo 2028  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ral 2458  df-rex 2459  df-reu 2460  df-rab 2462  df-v 2737  df-sbc 2961  df-csb 3056  df-un 3131  df-in 3133  df-ss 3140  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-uni 3806  df-iun 3884  df-br 3999  df-opab 4060  df-mpt 4061  df-id 4287  df-xp 4626  df-rel 4627  df-cnv 4628  df-co 4629  df-dm 4630  df-rn 4631  df-res 4632  df-ima 4633  df-iota 5170  df-fun 5210  df-fn 5211  df-f 5212  df-f1 5213  df-fo 5214  df-f1o 5215  df-fv 5216  df-top 13076  df-nei 13219
This theorem is referenced by:  topssnei  13242
  Copyright terms: Public domain W3C validator