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

Theorem topssnei 14749
Description: A finer topology has more neighborhoods. (Contributed by Mario Carneiro, 9-Apr-2015.)
Hypotheses
Ref Expression
tpnei.1  |-  X  = 
U. J
topssnei.2  |-  Y  = 
U. K
Assertion
Ref Expression
topssnei  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  J  C_  K )  ->  ( ( nei `  J ) `  S
)  C_  ( ( nei `  K ) `  S ) )

Proof of Theorem topssnei
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 simpl2 1004 . . . 4  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  ( J  C_  K  /\  x  e.  (
( nei `  J
) `  S )
) )  ->  K  e.  Top )
2 simprl 529 . . . . . 6  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  ( J  C_  K  /\  x  e.  (
( nei `  J
) `  S )
) )  ->  J  C_  K )
3 simpl1 1003 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  ( J  C_  K  /\  x  e.  (
( nei `  J
) `  S )
) )  ->  J  e.  Top )
4 simprr 531 . . . . . . . 8  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  ( J  C_  K  /\  x  e.  (
( nei `  J
) `  S )
) )  ->  x  e.  ( ( nei `  J
) `  S )
)
5 tpnei.1 . . . . . . . . 9  |-  X  = 
U. J
65neii1 14734 . . . . . . . 8  |-  ( ( J  e.  Top  /\  x  e.  ( ( nei `  J ) `  S ) )  ->  x  C_  X )
73, 4, 6syl2anc 411 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  ( J  C_  K  /\  x  e.  (
( nei `  J
) `  S )
) )  ->  x  C_  X )
85ntropn 14704 . . . . . . 7  |-  ( ( J  e.  Top  /\  x  C_  X )  -> 
( ( int `  J
) `  x )  e.  J )
93, 7, 8syl2anc 411 . . . . . 6  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  ( J  C_  K  /\  x  e.  (
( nei `  J
) `  S )
) )  ->  (
( int `  J
) `  x )  e.  J )
102, 9sseldd 3202 . . . . 5  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  ( J  C_  K  /\  x  e.  (
( nei `  J
) `  S )
) )  ->  (
( int `  J
) `  x )  e.  K )
115neiss2 14729 . . . . . . . 8  |-  ( ( J  e.  Top  /\  x  e.  ( ( nei `  J ) `  S ) )  ->  S  C_  X )
123, 4, 11syl2anc 411 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  ( J  C_  K  /\  x  e.  (
( nei `  J
) `  S )
) )  ->  S  C_  X )
135neiint 14732 . . . . . . 7  |-  ( ( J  e.  Top  /\  S  C_  X  /\  x  C_  X )  ->  (
x  e.  ( ( nei `  J ) `
 S )  <->  S  C_  (
( int `  J
) `  x )
) )
143, 12, 7, 13syl3anc 1250 . . . . . 6  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  ( J  C_  K  /\  x  e.  (
( nei `  J
) `  S )
) )  ->  (
x  e.  ( ( nei `  J ) `
 S )  <->  S  C_  (
( int `  J
) `  x )
) )
154, 14mpbid 147 . . . . 5  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  ( J  C_  K  /\  x  e.  (
( nei `  J
) `  S )
) )  ->  S  C_  ( ( int `  J
) `  x )
)
16 opnneiss 14745 . . . . 5  |-  ( ( K  e.  Top  /\  ( ( int `  J
) `  x )  e.  K  /\  S  C_  ( ( int `  J
) `  x )
)  ->  ( ( int `  J ) `  x )  e.  ( ( nei `  K
) `  S )
)
171, 10, 15, 16syl3anc 1250 . . . 4  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  ( J  C_  K  /\  x  e.  (
( nei `  J
) `  S )
) )  ->  (
( int `  J
) `  x )  e.  ( ( nei `  K
) `  S )
)
185ntrss2 14708 . . . . 5  |-  ( ( J  e.  Top  /\  x  C_  X )  -> 
( ( int `  J
) `  x )  C_  x )
193, 7, 18syl2anc 411 . . . 4  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  ( J  C_  K  /\  x  e.  (
( nei `  J
) `  S )
) )  ->  (
( int `  J
) `  x )  C_  x )
20 simpl3 1005 . . . . 5  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  ( J  C_  K  /\  x  e.  (
( nei `  J
) `  S )
) )  ->  X  =  Y )
217, 20sseqtrd 3239 . . . 4  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  ( J  C_  K  /\  x  e.  (
( nei `  J
) `  S )
) )  ->  x  C_  Y )
22 topssnei.2 . . . . 5  |-  Y  = 
U. K
2322ssnei2 14744 . . . 4  |-  ( ( ( K  e.  Top  /\  ( ( int `  J
) `  x )  e.  ( ( nei `  K
) `  S )
)  /\  ( (
( int `  J
) `  x )  C_  x  /\  x  C_  Y ) )  ->  x  e.  ( ( nei `  K ) `  S ) )
241, 17, 19, 21, 23syl22anc 1251 . . 3  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  ( J  C_  K  /\  x  e.  (
( nei `  J
) `  S )
) )  ->  x  e.  ( ( nei `  K
) `  S )
)
2524expr 375 . 2  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  J  C_  K )  ->  ( x  e.  ( ( nei `  J
) `  S )  ->  x  e.  ( ( nei `  K ) `
 S ) ) )
2625ssrdv 3207 1  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  J  C_  K )  ->  ( ( nei `  J ) `  S
)  C_  ( ( nei `  K ) `  S ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 981    = wceq 1373    e. wcel 2178    C_ wss 3174   U.cuni 3864   ` cfv 5290   Topctop 14584   intcnt 14680   neicnei 14725
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 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-top 14585  df-ntr 14683  df-nei 14726
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator