I don't understand how to prove this statement true or false.
If $5x \equiv 15 \pmod{25}$, then definitely $x \equiv 3 \pmod{25}$.
All I know is that $\frac{5}5x \equiv \frac{15}5 \pmod{\frac{25}5}$ = $x \equiv 3 \pmod{5}$, and $x \cdot 5 \equiv 3 \cdot 5 \pmod{25}$ = $5x \equiv 15 \pmod{25}$, how do you prove this equation?
The statement is false, because 5 is not divisible in $\mathbb Z_{25}$. And that is because gcd$(5,25)\neq 1$.
Simply put, you want to divide your equation by 5, to isolate $x$. Well dividing by 5 is to multiply by the inverse of 5, i.e. the number $b$ such that $5\cdot b=1\mod 25$. Note that there are no solutions for $b$, since the integer $5b$ ends either with 0 or 5, thus making it impossible to be congruent to 1 mod 25.
That means that you cannot divide by 5. All you have left is to try out the 25 possible values for $x$ in your equation. $x=3$ definitely solves it, but also does $x=8$, and probably more numbers.
In conclusion, your equation has multiple solutions, so no, $x$ is not definitely 3.