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

Theorem ssdisj 3879
Description: Intersection with a subclass of a disjoint class. (Contributed by FL, 24-Jan-2007.)
Assertion
Ref Expression
ssdisj  |-  ( ( A  C_  B  /\  ( B  i^i  C )  =  (/) )  ->  ( A  i^i  C )  =  (/) )

Proof of Theorem ssdisj
StepHypRef Expression
1 ss0b 3824 . . . 4  |-  ( ( B  i^i  C ) 
C_  (/)  <->  ( B  i^i  C )  =  (/) )
2 ssrin 3719 . . . . 5  |-  ( A 
C_  B  ->  ( A  i^i  C )  C_  ( B  i^i  C ) )
3 sstr2 3506 . . . . 5  |-  ( ( A  i^i  C ) 
C_  ( B  i^i  C )  ->  ( ( B  i^i  C )  C_  (/) 
->  ( A  i^i  C
)  C_  (/) ) )
42, 3syl 16 . . . 4  |-  ( A 
C_  B  ->  (
( B  i^i  C
)  C_  (/)  ->  ( A  i^i  C )  C_  (/) ) )
51, 4syl5bir 218 . . 3  |-  ( A 
C_  B  ->  (
( B  i^i  C
)  =  (/)  ->  ( A  i^i  C )  C_  (/) ) )
65imp 429 . 2  |-  ( ( A  C_  B  /\  ( B  i^i  C )  =  (/) )  ->  ( A  i^i  C )  C_  (/) )
7 ss0 3825 . 2  |-  ( ( A  i^i  C ) 
C_  (/)  ->  ( A  i^i  C )  =  (/) )
86, 7syl 16 1  |-  ( ( A  C_  B  /\  ( B  i^i  C )  =  (/) )  ->  ( A  i^i  C )  =  (/) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    = wceq 1395    i^i cin 3470    C_ wss 3471   (/)c0 3793
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-5 1705  ax-6 1748  ax-7 1791  ax-10 1838  ax-11 1843  ax-12 1855  ax-13 2000  ax-ext 2435
This theorem depends on definitions:  df-bi 185  df-an 371  df-tru 1398  df-ex 1614  df-nf 1618  df-sb 1741  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-v 3111  df-dif 3474  df-in 3478  df-ss 3485  df-nul 3794
This theorem is referenced by:  djudisj  5441  fimacnvdisj  5769  marypha1lem  7911  ackbij1lem16  8632  ackbij1lem18  8634  fin23lem20  8734  fin23lem30  8739  elcls3  19711  neindisj  19745  imadifxp  27600  diophren  30951
  Copyright terms: Public domain W3C validator