I'm a little stuck in my simplifying of this boolean logic expression. If it was $2 \times 2$, I know I could foil, but I can't find any law that will help me go any further. Would someone help me figure out where to go now?
In this attempt, $\cdot$ stands for logical AND, $+$ for logical OR, and $\overline{A}$ stands for NOT A.
Simplify: $\overline{(A+B)}\cdot\overline{(C+D+E)}+\overline{(A+B)}$ \begin{align} &\overline{(A+B)}\cdot\overline{(C+D+E)}+\overline{(A+B)}\\ \text{de Morgan's law}~~~&(\overline{A}\cdot\overline{B})\cdot(\overline{C}\cdot\overline{D}\cdot\overline{E})+\overline{(A+B)}\\ \text{de Morgan's law}~~~&(\overline{A}\cdot\overline{B})\cdot(\overline{C}\cdot\overline{D}\cdot\overline{E})+(\overline{A}\cdot \overline{B}) \end{align}
Here is an image of my attempt on paper.
You can just follow Eric Towers' comment:
Take $U = \overline{A+B}$ and $V = \overline{C+D+E}$, and apply one of the absorption laws: $$(U\cdot V)+U=U.$$ (The other would be $(U+V)\cdot U = U$.)
This was certainly what Michael Burr meant in his first comment.