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

Theorem sscond 3213
Description: If  A is contained in  B, then  ( C  \  B ) is contained in  ( C  \  A ). Deduction form of sscon 3210. (Contributed by David Moews, 1-May-2017.)
Hypothesis
Ref Expression
ssdifd.1  |-  ( ph  ->  A  C_  B )
Assertion
Ref Expression
sscond  |-  ( ph  ->  ( C  \  B
)  C_  ( C  \  A ) )

Proof of Theorem sscond
StepHypRef Expression
1 ssdifd.1 . 2  |-  ( ph  ->  A  C_  B )
2 sscon 3210 . 2  |-  ( A 
C_  B  ->  ( C  \  B )  C_  ( C  \  A ) )
31, 2syl 14 1  |-  ( ph  ->  ( C  \  B
)  C_  ( C  \  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    \ cdif 3068    C_ wss 3071
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-v 2688  df-dif 3073  df-in 3077  df-ss 3084
This theorem is referenced by:  ssdif2d  3215  setsresg  12011
  Copyright terms: Public domain W3C validator