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

Theorem ssdifin0 3324
Description: A subset of a difference does not intersect the subtrahend. (Contributed by Jeff Hankins, 1-Sep-2013.) (Proof shortened by Mario Carneiro, 24-Aug-2015.)
Assertion
Ref Expression
ssdifin0  |-  ( A 
C_  ( B  \  C )  ->  ( A  i^i  C )  =  (/) )

Proof of Theorem ssdifin0
StepHypRef Expression
1 ssrin 3191 . 2  |-  ( A 
C_  ( B  \  C )  ->  ( A  i^i  C )  C_  ( ( B  \  C )  i^i  C
) )
2 incom 3158 . . 3  |-  ( ( B  \  C )  i^i  C )  =  ( C  i^i  ( B  \  C ) )
3 disjdif 3316 . . 3  |-  ( C  i^i  ( B  \  C ) )  =  (/)
42, 3eqtri 2101 . 2  |-  ( ( B  \  C )  i^i  C )  =  (/)
5 sseq0 3285 . 2  |-  ( ( ( A  i^i  C
)  C_  ( ( B  \  C )  i^i 
C )  /\  (
( B  \  C
)  i^i  C )  =  (/) )  ->  ( A  i^i  C )  =  (/) )
61, 4, 5sylancl 404 1  |-  ( A 
C_  ( B  \  C )  ->  ( A  i^i  C )  =  (/) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1284    \ cdif 2970    i^i cin 2972    C_ wss 2973   (/)c0 3251
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-v 2603  df-dif 2975  df-in 2979  df-ss 2986  df-nul 3252
This theorem is referenced by:  ssdifeq0  3325
  Copyright terms: Public domain W3C validator