I have the following boolean algebra, where union is $+$ and intersection is $\cdot$ :
$(x\cdot y)+((z+y)\cdot \bar{z})+y=y$
Is there a systematic way of doing this, or do you need to puzzle? My train of thought would be to see if I could get rid of $z$ and $\bar{z}$ by putting them together, but am unsure if the operation for this needs to be $+$ or $\cdot$.
The other thing I tried to do is use the commutative and distributive property on $\bar{z}$ and $(z+y)$:
$(\bar{z} \cdot z)+(\bar{z} \cdot y) = \textit{0} + (\bar{z} \cdot y) = (\bar{z} \cdot y)$
but then I'm stuck with $(\bar{z} \cdot y)$, and there seems to be no way to get rid of $\bar{z}$ anymore.
I could also use the distributive property on $y$ and $((z+y)\cdot \bar{z})$ in $((z+y)\cdot \bar{z})+y$:
$(y+(z+y)) \cdot (y + \bar{z})=\\((y+z)+(y+y)) \cdot (y+ \bar{z})=\\((y+z)+y)\cdot(y+ \bar{z})=\\y+((y+z) \cdot(y+\bar{z}))=\\y+y+(z\cdot \bar{z})=\\y+\textit{0}=\\y$
This is nice (though I'm not sure step 3 and 4 are legit), but then I'm stuck with the $x$!
I would appreciate any help in this matter!