# how would prove this using for set operations is..... idempotent laws associa........

• Apr 23rd 2010, 08:32 AM
npm1
how would prove this using for set operations is..... idempotent laws associa........
how would i prove this using Set operations
i.e.
the operations i've been given are ........
idempotent laws
associative laws
commutative laws
distributive laws
identity laws
Involution laws
involution laws
complement laws
de morgans laws
$

\emptyset\;=\;((X \cup Y) \cap (X \cup Y')) \cap ((X' \cup Y) \cap (X' \cup Y'))
$

using set operations

if not then atleast provide a similar example...............OR
refer me to a website for learning this......
• Apr 23rd 2010, 09:12 AM
Soroban
Hello, npm1!

Quote:

Prove using Set operations:

. . $\bigg[(X \cup Y) \cap (X \cup Y')\bigg] \cap \bigg[(X' \cup Y) \cap (X' \cup Y')\bigg] \;=\;\emptyset$

. . $\begin{array}{ccc}\bigg[(X \cup Y) \cap (X \cup Y')\bigg] \cap \bigg[(X' \cup Y) \cap (X' \cup Y')\bigg] & \text{Given} \\ \\
\bigg[X \cup (Y \cap Y')\bigg] \cap \bigg[X' \cup (Y \cap Y')\bigg] & \text{Distr.} \\ \\

\bigg[X \cup\: \emptyset\bigg] \cap \bigg[X' \cup \:\emptyset\bigg] & A \cap A' \:=\:\emptyset \\ \\

X \cap X' & A \cup \emptyset \:=\:A \end{array}$

. . . . . . . . . . . . . . . . $\begin{array}{ccccccc}\emptyset & \qquad\qquad & \qquad\qquad\;\; & A \cap A' \:=\:\emptyset\end{array}$