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

Theorem topssnei 14885
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 1027 . . . 4  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  ( J  C_  K  /\  x  e.  (
( nei `  J
) `  S )
) )  ->  K  e.  Top )
2 simprl 531 . . . . . 6  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  ( J  C_  K  /\  x  e.  (
( nei `  J
) `  S )
) )  ->  J  C_  K )
3 simpl1 1026 . . . . . . 7  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  ( J  C_  K  /\  x  e.  (
( nei `  J
) `  S )
) )  ->  J  e.  Top )
4 simprr 533 . . . . . . . 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 14870 . . . . . . . 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 14840 . . . . . . 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 3228 . . . . 5  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  ( J  C_  K  /\  x  e.  (
( nei `  J
) `  S )
) )  ->  (
( int `  J
) `  x )  e.  K )
115neiss2 14865 . . . . . . . 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 14868 . . . . . . 7  |-  ( ( J  e.  Top  /\  S  C_  X  /\  x  C_  X )  ->  (
x  e.  ( ( nei `  J ) `
 S )  <->  S  C_  (
( int `  J
) `  x )
) )
143, 12, 7, 13syl3anc 1273 . . . . . 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 14881 . . . . 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 1273 . . . 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 14844 . . . . 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 1028 . . . . 5  |-  ( ( ( J  e.  Top  /\  K  e.  Top  /\  X  =  Y )  /\  ( J  C_  K  /\  x  e.  (
( nei `  J
) `  S )
) )  ->  X  =  Y )
217, 20sseqtrd 3265 . . . 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 14880 . . . 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 1274 . . 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 3233 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 1004    = wceq 1397    e. wcel 2202    C_ wss 3200   U.cuni 3893   ` cfv 5326   Topctop 14720   intcnt 14816   neicnei 14861
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-top 14721  df-ntr 14819  df-nei 14862
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator