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

Theorem sscond 3110
Description: If  A is contained in  B, then  ( C  \  B ) is contained in  ( C  \  A ). Deduction form of sscon 3107. (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 3107 . 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 2971    C_ wss 2974
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 577  ax-in2 578  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2064
This theorem depends on definitions:  df-bi 115  df-tru 1288  df-nf 1391  df-sb 1687  df-clab 2069  df-cleq 2075  df-clel 2078  df-nfc 2209  df-v 2604  df-dif 2976  df-in 2980  df-ss 2987
This theorem is referenced by:  ssdif2d  3112
  Copyright terms: Public domain W3C validator