Let, $$E\subset \mathbb R$$ be a non empty bounded above set. Define $$ -E = \{ -x : x \in E \}.$$ Then, $\operatorname{inf} (-E) = -\operatorname{sup}(E)$.
Proof - It follows from the completeness property that $$\exists x_o < x , \forall x_o \in E$$
such that, $$ \operatorname{sup}(E) = x \tag {1} \label{1}$$
Since, it is already given that the set is bounded, it must have a lower bound. $$ \exists x_o < x, \forall x_o \in E,$$ we have shown already.
Now, $$ \forall x_o>x ,\exists x_o \notin E$$
such that, $$ \operatorname{inf}(E) = -x \tag {2} \label{2}$$
From (1) and (2), we get -
$$\operatorname{inf}(E) = -x = -\operatorname{sup}(E)$$
Hence, proved. (black dot to the far left)
I know there might be many logic blunders. I hope to solidify my logic and understanding through the feedback! :D
If you have that $\exists x_{0}$ such that $\forall x\in E$, $x\le x_{0}=sup(E)$ if you multiply by $-1$ the inequality you have that $y=-x\ge -x_{0}=-sup(E)$, $\forall x\in E$, $\forall y\in -E$, you have that $inf(-E)\ge -sup(E)$. So you have to prove that they are equals. (Hint: prove the other inequality).