Prove $(A \cup B)' = A' \cap B'$ I would like some assistance in verifying this proof? 
(I understand the last conjecture about "symmetry" is probably shaky, but I just want to know if the first part is right since going backwards will more than likely be the same as is usually the case in such proofs). 
We seek to prove $(A \cup B)' = A' \cap B'$.

Suppose we have the universal set $U$.
We know $x \in (A \cup B)'$.
$\implies x \in U - (A \cup B)$.
Thus $x \in U \land x \notin (A \cup B)$.
$x \notin A \lor x \notin B \implies x \notin (A \cap B)$.
So $x \in U \land (x \notin (A \cap B))$.
$\implies x \in U \land (x \notin A \land x \notin B) $.
$\implies (x \in U \land x \notin A) \land (x \in U \land x \notin B)$
$\implies x \in (U-A) \land x \in (U-B)$ 
$\implies x \in A' \land x \in B'$
$\implies x \in A' \cap B'$
By the symmetry of the situation we see that $x \in A' \cap B' \implies x \in (A \cup B)' $.
Therefore the sets are subsets of one another, therefore they are equal.

Your proof is good. 
Instead of saying "by the symmetry of the situation", which is somewhat ambiguous, you could replace the implication arrows to go both ways, i.e. $\Leftrightarrow$. That is the standard way to say what you mean. Just make sure that the proof is then readable backwards as well. 
However, if you are unsure, it is easier to avoid mistakes if you write the forward case $\Rightarrow$ and backward case $\Leftarrow$ separately.
