Show that if , then .
Given:
To prove:
Proof:
Let be an arbitrary element of .
By definition of difference of sets, means that and .
Since (given), every element of is also an element of . This means if any element belongs to , it must also belong to .
Now, since , and , the element cannot belong to . If were in , then by the subset relation , would have to be in , which contradicts our condition that .
Therefore, .
So we have established that and . By definition of set difference, this means .
Since was an arbitrary element chosen from , and we have shown that , we conclude that every element of is also an element of .
Therefore, .
Hence proved.
Explanation
This question tests understanding of subset relation and set difference operation. The proof uses the definition that means every element of is in .
The key insight is that if an element is NOT in , it cannot be in (since all elements of are in ). The textbook defines as elements belonging to but not to , which is essential for this proof.
Solution Steps
Step 1: Let be an arbitrary element of
Step 2: By definition, and
Step 3: Since , if then
Step 4: Therefore and , so
Step 5: Conclude