SOLVER7 Study. Nothing Else.
Miscellaneous Exercise Chapter 1 Q5

Show that if \(A \subset B,\) then \(C – B \subset C – A.\)

CBSE Class 11 Maths · Sets

Solution

👶 Simple Explanation

Simple Explanation

Imagine set \( A \) is a small club, and set \( B \) is a bigger club that contains everyone from \( A \). Now set \( C \) is a classroom. When you remove the bigger club \( B \) from the classroom, fewer people remain than if you removed only the smaller club \( A \). So \( C - B \) has fewer or equal members compared to \( C - A \). Every person left after removing \( B \) was definitely not in \( A \) either, since \( A \) is inside \( B \). That is why \( C - B \) fits inside \( C - A \).

Answer: Since every element of \( C - B \) is also an element of \( C - A \), we have proved that if \( A \subset B \), then \( C - B \subset C - A \).

📖 Proving C - B \subset C - A when A \subset B

Detailed Explanation

To prove that one set is a subset of another, we use the definition of subset. A set \( P \) is a subset of a set \( Q \), written \( P \subset Q \), if every element of \( P \) is also an element of \( Q \). So to show \( C - B \subset C - A \), we take any arbitrary element \( x \) of \( C - B \) and show that this same \( x \) must belong to \( C - A \). We also use the definition of set difference: \( C - B = \{ x : x \in C \text{ and } x \notin B \} \). The key given fact is \( A \subset B \), which means every element of \( A \) lies in \( B \). Taking the contrapositive, if an element is NOT in \( B \), then it is NOT in \( A \) either. This idea drives the whole proof.

Formula Used

Set difference: \( C - B = \{ x : x \in C \text{ and } x \notin B \} \). Subset definition: \( P \subset Q \) means for all \( x \), if \( x \in P \) then \( x \in Q \).

Solution

  1. Step 1: Start by taking an arbitrary element. Let \( x \in C - B \). Our goal is to prove that this same \( x \) also belongs to \( C - A \).
  2. Step 2: Apply the definition of set difference. Since \( x \in C - B \), by definition we have \( x \in C \) and \( x \notin B \).
  3. Step 3: Use the given condition \( A \subset B \). This means every element of \( A \) is also an element of \( B \). Its contrapositive says: if \( x \notin B \), then \( x \notin A \). Since we already know \( x \notin B \), it follows that \( x \notin A \).
  4. Step 4: Combine the results. From Step 2 we have \( x \in C \), and from Step 3 we have \( x \notin A \). Together these give \( x \in C \) and \( x \notin A \).
  5. Step 5: Apply the definition of set difference again. Since \( x \in C \) and \( x \notin A \), by definition \( x \in C - A \).
  6. Step 6: Conclude. We took an arbitrary \( x \in C - B \) and showed \( x \in C - A \). Since this holds for every such \( x \), we conclude \( C - B \subset C - A \).

Final Answer

Since every element of \( C - B \) is also an element of \( C - A \), we have proved that if \( A \subset B \), then \( C - B \subset C - A \).

Common Mistake

A common mistake is misusing the given fact \( A \subset B \). Students sometimes conclude that \( x \notin B \) implies \( x \in A \), which is wrong. The correct contrapositive of \( A \subset B \) is: if \( x \notin B \) then \( x \notin A \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Choose an arbitrary element from \( C - B \). Let \( x \in C - B \). Our goal is to show that this very same \( x \) must also belong to \( C - A \) — Reason: The standard method to prove \( C - B \subset C - A \) is to take any element of \( C - B \) and verify it lies in \( C - A \).
  2. Step 2: Unpack the meaning of \( x \in C - B \) using the set-difference definition. Since \( x \in C - B \), we get two facts: \( x \in C \) and \( x \notin B \) — Reason: By definition, \( C - B = \\{ x : x \in C \text{ and } x \notin B \\} \), so membership in \( C - B \) gives us both conditions simultaneously.
  3. Step 3: Apply the given condition \( A \subset B \) in its contrapositive form. Since \( A \subset B \), every element of \( A \) is an element of \( B \). The contrapositive states: if \( x \notin B \), then \( x \notin A \). We already know \( x \notin B \) from Step 2, so we conclude \( x \notin A \) — Reason: The contrapositive of a true implication is always true, and it lets us move from information about \( B \) to a conclusion about \( A \).
  4. Step 4: Combine the two results obtained so far. From Step 2 we have \( x \in C \), and from Step 3 we have \( x \notin A \). Together these give \( x \in C \) and \( x \notin A \) — Reason: Both conditions must hold simultaneously to claim membership in the set \( C - A \).
  5. Step 5: Conclude membership in \( C - A \). Since \( x \in C \) and \( x \notin A \), by the definition of set difference we have \( x \in C - A \) — Reason: The set \( C - A = \\{ x : x \in C \text{ and } x \notin A \\} \), so both conditions being satisfied is exactly what we need.
  6. Step 6: Wrap up the proof. We started with an arbitrary \( x \in C - B \) and showed \( x \in C - A \). Because \( x \) was arbitrary, every element of \( C - B \) is also an element of \( C - A \), which by definition means \( C - B \subset C - A \) — Reason: Since no specific property of \( x \) was used other than \( x \in C - B \), the argument holds for all such elements, completing the proof.

Final Answer

Since every element of \( C - B \) is also an element of \( C - A \), we have proved that if \( A \subset B \), then \( C - B \subset C - A \).

Common Mistake

One common mistake: students try to prove the result by working with specific elements or examples instead of taking an arbitrary element of \( C - B \) — subset proofs require the argument to hold for ALL elements, so you must start with a general \( x \in C - B \) and derive \( x \in C - A \) without assuming anything extra about \( x \).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Let \( x \in C - B \). Then \( x \in C \) and \( x \notin B \).
  2. Step 2: Given \( A \subset B \): contrapositive gives \( x \notin B \Rightarrow x \notin A \). So \( x \notin A \).
  3. Step 3: \( x \in C \) and \( x \notin A \) implies \( x \in C - A \). Hence \( C - B \subset C - A \).

Answer: Since every element of \( C - B \) is also an element of \( C - A \), we have proved that if \( A \subset B \), then \( C - B \subset C - A \).

➕ More Examples

More Examples

Example 1

Question: Let \( P \), \( Q \), and \( R \) be any three sets. Show that if \( P \subseteq Q \), then \( R - Q \subseteq R - P \).

Solution: We need to prove that every element of \( R - Q \) also belongs to \( R - P \). Let \( x \) be an arbitrary element such that \( x \in R - Q \). By the definition of set difference, this means \( x \in R \) and \( x \notin Q \). We are given that \( P \subseteq Q \), which means every element of \( P \) is also an element of \( Q \). Since \( x \notin Q \), it follows that \( x \) cannot belong to any subset of \( Q \). In particular, \( x \notin P \). So we have established that \( x \in R \) and \( x \notin P \). By the definition of set difference, \( x \in R - P \). Since \( x \) was an arbitrary element of \( R - Q \), we have shown that every element of \( R - Q \) belongs to \( R - P \). Therefore, \( R - Q \subseteq R - P \).

Answer: \( R - Q \subseteq R - P \) is proved: if \( P \subseteq Q \), any element in \( R - Q \) satisfies \( x \in R \) and \( x \notin Q \), so \( x \notin P \) (since \( P \subseteq Q \)), giving \( x \in R - P \).

Example 2

Question: For any three sets \( X \), \( Y \), and \( Z \), prove that \( X \subseteq Y \) implies \( Z - Y \subseteq Z - X \). Also verify this with a concrete example by taking \( X = \{1, 2\} \), \( Y = \{1, 2, 3, 4\} \), and \( Z = \{2, 3, 5, 6\} \).

Solution: Part 1 — General Proof: Assume \( X \subseteq Y \). Let \( a \) be any element with \( a \in Z - Y \). By definition of set difference, \( a \in Z \) and \( a \notin Y \). Since \( X \subseteq Y \), every element of \( X \) is in \( Y \). Since \( a \notin Y \), it follows that \( a \notin X \). Thus \( a \in Z \) and \( a \notin X \), which gives \( a \in Z - X \). Since \( a \) was arbitrary, \( Z - Y \subseteq Z - X \). Part 2 — Verification with \( X = \{1, 2\} \), \( Y = \{1, 2, 3, 4\} \), \( Z = \{2, 3, 5, 6\} \): First, note that \( X \subseteq Y \) since every element of \( X \) (namely 1 and 2) is in \( Y \). Compute \( Z - Y \): elements in \( Z \) but not in \( Y \). \[ Z - Y = \{2, 3, 5, 6\} - \{1, 2, 3, 4\} = \{5, 6\} \] Compute \( Z - X \): elements in \( Z \) but not in \( X \). \[ Z - X = \{2, 3, 5, 6\} - \{1, 2\} = \{3, 5, 6\} \] Now check: Is \( Z - Y \subseteq Z - X \)? We have \( Z - Y = \{5, 6\} \) and \( Z - X = \{3, 5, 6\} \). Since every element of \( \{5, 6\} \) is indeed in \( \{3, 5, 6\} \), we confirm \( Z - Y \subseteq Z - X \).

Answer: Proved in general, and verified: \( Z - Y = \{5, 6\} \subseteq \{3, 5, 6\} = Z - X \), confirming \( Z - Y \subseteq Z - X \) when \( X \subseteq Y \).

🎯 Try a Similar Question

Try a Similar Question

Question: Let \( P \), \( Q \), and \( R \) be any three sets. Prove that if \( B \subset A \), then \( R - A \subset R - B \).

Solution

  1. Step 1: Assume the hypothesis: We are given that \( B \subset A \). This means every element of \( B \) is also an element of \( A \), i.e., for all \( x \), if \( x \in B \) then \( x \in A \).
  2. Step 2: Take an arbitrary element from \( R - A \): Let \( x \) be an arbitrary element of \( R - A \). By definition of set difference, \( x \in R - A \) means \( x \in R \) and \( x \notin A \).
  3. Step 3: Use the subset condition to deduce \( x \notin B \): Since \( B \subset A \), every element of \( B \) belongs to \( A \). We know \( x \notin A \). If \( x \) were in \( B \), then since \( B \subset A \), we would have \( x \in A \), which is a contradiction. Therefore \( x \notin B \).
  4. Step 4: Conclude \( x \in R - B \): We have established that \( x \in R \) and \( x \notin B \). By the definition of set difference, this means \( x \in R - B \).
  5. Step 5: Conclude the subset relationship: Since \( x \) was an arbitrary element of \( R - A \) and we showed \( x \in R - B \), every element of \( R - A \) is also an element of \( R - B \). By the definition of subset, \( R - A \subset R - B \).

Answer: Since every element of \( R - A \) is also an element of \( R - B \), we have proved that if \( B \subset A \), then \( R - A \subset R - B \). Note that here the subset relation is reversed compared to the original problem: starting with \( B \subset A \) gives \( R - A \subset R - B \), not \( R - B \subset R - A \).

Everything you get with Solver7

More questions in Sets