Boolean algebra proof - point me in the right direction?

I wish to formulate a proof that if $x+y = x+z$ and $xy$ = $xz$ then $y=z$. I'm just beginning my study of Boolean algebra, but is $y=z$ not self evident from the stated equations?

-
What happens if you add $x$ to both sides of the first equality ? – Siméon Dec 6 '12 at 23:06
$x+x=x$ so both sides remain the same? – Jason Byrne Dec 6 '12 at 23:14
Does '$+$' stands for 'xor' or for 'or' in your definition? – Siméon Dec 6 '12 at 23:17
Oh sorry, '+' stands for 'or' – Jason Byrne Dec 6 '12 at 23:18
Ok, my mistake then. From $x+y=x+z$ you can derive $(\neg x)y = (\neg x)z$ and then compute $(\neg x + x)y = \dots$. – Siméon Dec 6 '12 at 23:21

$x$ is either true or false. In either case you can derive $y=z$ from one of the equations.
Use absorption and distributivity: $$y=y(x+y)=y(x+z)=yx+yz=zx+yz=z(x+y)=z(x+z)=z.$$