Proving that $-a=(-1)\cdot a$
$$a+(-1)a=(1)a+(-1)a=(1+(-1))a=0\cdot a=0$$Hence by definition we have that $-a=(-1)a$
Added: We also want to show that the additive inverse of $a$ has no ambiguities, i.e., if $x$ and $y$ are the additive inverses of $a$ then $x=y$ and hence we can just denote this element by $-a$. Proof: $$x=x+0=x+(a+y)=(x+a)+y=0+y=y$$
Hint $\ $ Both are inverses of $\rm\:a\:$ so they are equal by uniqueness of inverses, viz.
$$\rm \begin{array}{} a'+a\ =\: 0\\ \rm \: a+a'' =\:\! 0\end{array}\quad\Rightarrow\quad a'\: =\ a' + (a + a'')\ =\ (a' + a) + a'' =\: a''$$ Using that, it suffices to prove that $\rm\:\ (-1)\:a + a = 0,\ $ i.e. $\rm\:(-1)\:a\:$ is an inverse of $\rm\:a\:.$ This follows easily by the ring axioms (hint: scale $\rm\: -1\: +\: 1\: =\: 0\:$ by $\rm\:a\:$).
It is useful to abstract out the lemma on uniqueness of inverses since it is ubiquitous in algebra.
Also, as I often emphasize, uniqueness theorems provide powerful tools for proving equalities.