Discrete Mathematics with Applications 4th Edition

Published by Cengage Learning
ISBN 10: 0-49539-132-8
ISBN 13: 978-0-49539-132-6

Chapter 6 - Set Theory - Exercise Set 6.3 - Page 372: 12

Answer

This statement is true. Claim: For all sets A, B, and C, A ∩ (B − C) = (A ∩ B) − (A ∩ C). Proof: Suppose A, B, and C are any sets. Let x ϵ A ⋂ (B – C). By definition of intersection, x ϵ A and x ϵ (B – C). By definition of set difference, x ϵ B and x  C. Therefore, x ϵ A and x ϵ B, and x ϵ A and x  C. Since x ϵ A and x ϵ B, then x ϵ (A ⋂ B) by definition of intersection. Since x ϵ A and x  C, then x  (A ⋂ C) by definition of intersection. By definition of set difference, x ϵ (A ∩ B) − (A ∩ C). Therefore, if x ϵ A ⋂ (B – C), then x ϵ (A ∩ B) − (A ∩ C). By definition of subset, A ⋂ (B – C) ⊆ (A ∩ B) − (A ∩ C). Suppose A, B, and C are any sets. Let x ϵ (A ∩ B) − (A ∩ C). By definition of set differences, x ϵ (A ⋂ B) and x  (A ⋂ C). By definition of intersection, x ϵ A and x ϵ B. By definition of intersection, x  (A ⋂ C) implies that x  C. Since x ϵ B and x  C, then x ϵ (B – C) by definition of set difference. Since x ϵ A and x ϵ (B – C), x ϵ A ⋂ (B – C) by definition of intersection. Therefore, if x ϵ (A ∩ B) − (A ∩ C), then x ϵ A ⋂ (B – C). By definition of subset, (A ∩ B) − (A ∩ C) ⊆ A ⋂ (B – C). Since A ⋂ (B – C) ⊆ (A ∩ B) − (A ∩ C) and (A ∩ B) − (A ∩ C) ⊆ A ⋂ (B – C), then A ∩ (B − C) = (A ∩ B) − (A ∩ C) by definition of subset equality.

Work Step by Step

Claim: For all sets A, B, and C, A ∩ (B − C) = (A ∩ B) − (A ∩ C). Proof: Suppose A, B, and C are any sets. Let x ϵ A ⋂ (B – C). By definition of intersection, x ϵ A and x ϵ (B – C). By definition of set difference, x ϵ B and x  C. Therefore, x ϵ A and x ϵ B, and x ϵ A and x  C. Since x ϵ A and x ϵ B, then x ϵ (A ⋂ B) by definition of intersection. Since x ϵ A and x  C, then x  (A ⋂ C) by definition of intersection. By definition of set difference, x ϵ (A ∩ B) − (A ∩ C). Therefore, if x ϵ A ⋂ (B – C), then x ϵ (A ∩ B) − (A ∩ C). By definition of subset, A ⋂ (B – C) ⊆ (A ∩ B) − (A ∩ C). Suppose A, B, and C are any sets. Let x ϵ (A ∩ B) − (A ∩ C). By definition of set differences, x ϵ (A ⋂ B) and x  (A ⋂ C). By definition of intersection, x ϵ A and x ϵ B. By definition of intersection, x  (A ⋂ C) implies that x  C. Since x ϵ B and x  C, then x ϵ (B – C) by definition of set difference. Since x ϵ A and x ϵ (B – C), x ϵ A ⋂ (B – C) by definition of intersection. Therefore, if x ϵ (A ∩ B) − (A ∩ C), then x ϵ A ⋂ (B – C). By definition of subset, (A ∩ B) − (A ∩ C) ⊆ A ⋂ (B – C). Since A ⋂ (B – C) ⊆ (A ∩ B) − (A ∩ C) and (A ∩ B) − (A ∩ C) ⊆ A ⋂ (B – C), then A ∩ (B − C) = (A ∩ B) − (A ∩ C) by definition of subset equality.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.