Prove that given $A\subseteq\mathbb{R}$, if has a maximum $a_0$, then $a_0$ must be the supremum.
In order to prove this, I have written the following:
Let $A\subseteq \mathbb{R}$, nonempty set because $a_{0}$ $\in A$ for hypotesis. Then, since $a_{0}$ $\in A$ is the largest element of the set $A$ (i.e. for each element $A$ of A we have that $ a\leq a_{0}$) $A$ is bounded above. Then, A has a supremum. Let $s$ be the least upper bound of $A,$ so we have that for each element $a$ of $A$, $a\leq s$, for being $s$ an upper bound. In particular, $a_0\leq s$, which implies that $s=a_0$.
Then, we have that $\sup(A)=\max(A)=a_0$, which is exactly what we wanted to prove.
Observation: this proof is true if $s \in A$
I'm not sure if my proof is correct. I will be thankful if someone tells me.
You have not be given the fact that $A$ is bounded from above. It is not empty because it contains $a_0$. Since $a_0$ is its maximum, then $A$ is bounded from above by $a_0+1$. Hence it is not empty and it is bounded from above. Since it is a subset of $\mathbb{R}$, it has a supremum.
Let $b$ be the supremum of $A$. Since $a_0\in A$, $a_0 \le b$. Now you need to show that $a_0 \ge b$.
Let $\epsilon > 0$ be given. Since $b$ is the supremum of $A$, there is an $x \in A$ such that $b - \epsilon \le x$. But then $$ b - \epsilon \le x \le a_0 $$ since $a_0$ is the maximum of $A$. Since $\epsilon$ was arbitrary, we can conclude that $$ b \le a_0 $$ Hence $a_0=b$.