Adding a condition to make a set theory identity true

**Let A, B, and C be sets. The formula**

$\displaystyle A-(B-C) = (A-B)\cup C$

is sometimes false. State an additional necessary and sufficient condition for it to be always true.

(The minus sign here means set difference.) It is pretty easy for me to come up with sufficient conditions (i.e., if $\displaystyle C\subseteq A$ and $\displaystyle B\cap C=\varnothing$, then the equation is true), but I'm not sure how to find a necessary condition.

Any element which is in both sets above must be in A. I think we could have three cases:

1. $\displaystyle x\in A$, $\displaystyle x\not\in B$, $\displaystyle x\in C$.

2. $\displaystyle x\in A$, $\displaystyle x\not\in B$, $\displaystyle x\not\in C$.

3. $\displaystyle x\in A$, $\displaystyle x\in B$, $\displaystyle x\in C$.

But I'm not really sure where to go from there.

Re: Adding a condition to make a set theory identity true

Quote:

Originally Posted by

**Ragnarok** **Let A, B, and C be sets. The formula**

$\displaystyle A-(B-C) = (A-B)\cup C$

is sometimes false. State an additional necessary and sufficient condition for it to be always true.

$\displaystyle \begin{align*} A\setminus (B\setminus C)&=A\cap (B\cap C^c)^c\\ &= A\cap(B^c\cup C)\\&=(A\cap B^c)\cup(A\cap C)\end{align*}$

Now what if $\displaystyle C\subseteq A~?$ Does equality hold?

If $\displaystyle A=\{1,2,3\},~B=\{2,3,4\},~C=\{3,4,5\}$, does equality hold? What is the difference?

Re: Adding a condition to make a set theory identity true

Okay, I'm starting to see. It is a necessary condition that $\displaystyle C\subseteq A$ since if it is not then there is an element which is in the second set but not the first. I think this is a sufficient condition too? I'll go check…

Thank you!