For example:
Given $ A\subset B $ reduce $\left [ (B\triangle C )\bigcap (A-B)\bigcap (A \triangle B) \right ]\bigcup B $
$A \triangle B$ denotes the symmetric difference of the two sets.
Edit
Possible results
A, B, C, U, $ \phi $
For example:
Given $ A\subset B $ reduce $\left [ (B\triangle C )\bigcap (A-B)\bigcap (A \triangle B) \right ]\bigcup B $
$A \triangle B$ denotes the symmetric difference of the two sets.
Possible results
A, B, C, U, $ \phi $
Set theory operations can be expressed through Boolean operations. Your expression is equivalent to
(Xor[b, c] && (a && ! b) && Xor[a, b]) || b
Think of a as standing for the statement $x \in A$, etc. Then e.g. $x \in (A - B)$ is equivalent to $x \in A \wedge x \notin B$. Thus for $A - B$ we write a && !b. Similarly, the symmetric difference is equivalent to Xor.
The expression above can be simplified to
Simplify[(Xor[b, c] && (a && ! b) && Xor[a, b]) || b]
(* (a && c) || b *)
We still need to use the fact that $A \subset B$. Think of this as $x \in A \Rightarrow x \in B$. Thus
Simplify[Implies[a, b] && %]
(* b *)
The result is b, i.e. $B$.
% and press F1, or see here: http://mathematica.stackexchange.com/a/25616/12
– Szabolcs
Feb 16 '17 at 20:32
Complementacts on lists treated as sets;Xor,And,Oract on sequences of truth values (True,False). Entirely different domains. You can't combine them the way you did in your comment and expect to get a meaningful result. – m_goldberg Feb 16 '17 at 05:35