de Morgan's Laws

Let $\cup$ represent ``or'', $\cap$ represent ``and'', and $'$ represent ``not.'' Then, for two logical units $E$ and $F$,

$$(E\cup F)' = E'\cap F'$$

$$(E\cap F)' = E'\cup F'.$$