I have to prove the following theorem(Apostol's Calculus I, exercise 1 page 19):
If $ab = 0$ then either $a = 0$ or $b = 0$.
My attempt to solve it was: $ab = 0$ can be rewritten as $ab = a0$, because $a0 = 0$(already been proved). So we now can cut a on both sides(already been proved too), so we have $b = 0$. Also, we could rewrite the original equation as $ab = b0$ and b on both sides of equation and turn it into $a = 0$.
I think my proof covers the basic steps but I don't think it's asserting anything.
This is almost perfect but you missing a bit:
Here you need to add "assuming that $a\ne 0$" to be able to justify the last part.
Same thing with:
You need to first assume that $b\ne 0$.
Now you left with the case that $a=b=0$, in which case it is trivial.
As @Theo point out we can do it using only $2$ cases:
Either $a\ne 0$ hence we can do the cancellation: $ab=a0\implies b=0$
Or $a=0$, in this case we are done.