MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ntrss Unicode version

Theorem ntrss 17074
Description: Subset relationship for interior. (Contributed by NM, 3-Oct-2007.)
Hypothesis
Ref Expression
clscld.1  |-  X  = 
U. J
Assertion
Ref Expression
ntrss  |-  ( ( J  e.  Top  /\  S  C_  X  /\  T  C_  S )  ->  (
( int `  J
) `  T )  C_  ( ( int `  J
) `  S )
)

Proof of Theorem ntrss
StepHypRef Expression
1 sscon 3441 . . . . . . 7  |-  ( T 
C_  S  ->  ( X  \  S )  C_  ( X  \  T ) )
21adantl 453 . . . . . 6  |-  ( ( S  C_  X  /\  T  C_  S )  -> 
( X  \  S
)  C_  ( X  \  T ) )
3 difss 3434 . . . . . 6  |-  ( X 
\  T )  C_  X
42, 3jctil 524 . . . . 5  |-  ( ( S  C_  X  /\  T  C_  S )  -> 
( ( X  \  T )  C_  X  /\  ( X  \  S
)  C_  ( X  \  T ) ) )
5 clscld.1 . . . . . . 7  |-  X  = 
U. J
65clsss 17073 . . . . . 6  |-  ( ( J  e.  Top  /\  ( X  \  T ) 
C_  X  /\  ( X  \  S )  C_  ( X  \  T ) )  ->  ( ( cls `  J ) `  ( X  \  S ) )  C_  ( ( cls `  J ) `  ( X  \  T ) ) )
763expb 1154 . . . . 5  |-  ( ( J  e.  Top  /\  ( ( X  \  T )  C_  X  /\  ( X  \  S
)  C_  ( X  \  T ) ) )  ->  ( ( cls `  J ) `  ( X  \  S ) ) 
C_  ( ( cls `  J ) `  ( X  \  T ) ) )
84, 7sylan2 461 . . . 4  |-  ( ( J  e.  Top  /\  ( S  C_  X  /\  T  C_  S ) )  ->  ( ( cls `  J ) `  ( X  \  S ) ) 
C_  ( ( cls `  J ) `  ( X  \  T ) ) )
98sscond 3444 . . 3  |-  ( ( J  e.  Top  /\  ( S  C_  X  /\  T  C_  S ) )  ->  ( X  \ 
( ( cls `  J
) `  ( X  \  T ) ) ) 
C_  ( X  \ 
( ( cls `  J
) `  ( X  \  S ) ) ) )
10 sstr2 3315 . . . . 5  |-  ( T 
C_  S  ->  ( S  C_  X  ->  T  C_  X ) )
1110impcom 420 . . . 4  |-  ( ( S  C_  X  /\  T  C_  S )  ->  T  C_  X )
125ntrval2 17070 . . . 4  |-  ( ( J  e.  Top  /\  T  C_  X )  -> 
( ( int `  J
) `  T )  =  ( X  \ 
( ( cls `  J
) `  ( X  \  T ) ) ) )
1311, 12sylan2 461 . . 3  |-  ( ( J  e.  Top  /\  ( S  C_  X  /\  T  C_  S ) )  ->  ( ( int `  J ) `  T
)  =  ( X 
\  ( ( cls `  J ) `  ( X  \  T ) ) ) )
145ntrval2 17070 . . . 4  |-  ( ( J  e.  Top  /\  S  C_  X )  -> 
( ( int `  J
) `  S )  =  ( X  \ 
( ( cls `  J
) `  ( X  \  S ) ) ) )
1514adantrr 698 . . 3  |-  ( ( J  e.  Top  /\  ( S  C_  X  /\  T  C_  S ) )  ->  ( ( int `  J ) `  S
)  =  ( X 
\  ( ( cls `  J ) `  ( X  \  S ) ) ) )
169, 13, 153sstr4d 3351 . 2  |-  ( ( J  e.  Top  /\  ( S  C_  X  /\  T  C_  S ) )  ->  ( ( int `  J ) `  T
)  C_  ( ( int `  J ) `  S ) )
17163impb 1149 1  |-  ( ( J  e.  Top  /\  S  C_  X  /\  T  C_  S )  ->  (
( int `  J
) `  T )  C_  ( ( int `  J
) `  S )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359    /\ w3a 936    = wceq 1649    e. wcel 1721    \ cdif 3277    C_ wss 3280   U.cuni 3975   ` cfv 5413   Topctop 16913   intcnt 17036   clsccl 17037
This theorem is referenced by:  ntrin  17080  ntrcls0  17095  dvreslem  19749  dvres2lem  19750  dvaddbr  19777  dvmulbr  19778  dvcnvrelem2  19855  ntruni  26220  cldregopn  26224
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-13 1723  ax-14 1725  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2385  ax-rep 4280  ax-sep 4290  ax-nul 4298  ax-pow 4337  ax-pr 4363  ax-un 4660
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2258  df-mo 2259  df-clab 2391  df-cleq 2397  df-clel 2400  df-nfc 2529  df-ne 2569  df-ral 2671  df-rex 2672  df-reu 2673  df-rab 2675  df-v 2918  df-sbc 3122  df-csb 3212  df-dif 3283  df-un 3285  df-in 3287  df-ss 3294  df-nul 3589  df-if 3700  df-pw 3761  df-sn 3780  df-pr 3781  df-op 3783  df-uni 3976  df-int 4011  df-iun 4055  df-iin 4056  df-br 4173  df-opab 4227  df-mpt 4228  df-id 4458  df-xp 4843  df-rel 4844  df-cnv 4845  df-co 4846  df-dm 4847  df-rn 4848  df-res 4849  df-ima 4850  df-iota 5377  df-fun 5415  df-fn 5416  df-f 5417  df-f1 5418  df-fo 5419  df-f1o 5420  df-fv 5421  df-top 16918  df-cld 17038  df-ntr 17039  df-cls 17040
  Copyright terms: Public domain W3C validator