If C is a subset of A and D is a subset of B, prove D-A is a subset of B-C.
I'm not sure how to do this. I know that I need to prove that every element in D-A is also in B-C, but how?
So, you know what you want to get to, so just start, and follow your nose. where did you get stuck?
We need to show that , so...
Assume . Then, but . But and so , or equivalently, by the contrapositive, . Thus we have that ....
How do you think you should proceed now?
yup
so, you knew what you needed to prove. It was an implication, . Those you can prove one of three ways.
Directly: Assume and show follows.
By the contrapositive (prove ): Assume and show follows.
By contradiction: Assume is true, and show that a contradiction arises.
With set proofs like this, i find that the direct proof is often the best way to go. So just assume the antecedent is true (the first statement in the implication, the P), and try to get to the consequent (the Q). So that's how you'd start if you don't know what to do. just jump in and hope for the best.