Proof verification for proving greatest lower bound for a set with a lower bound.

Question

Given that every set with an upper bound has least upper bound, I have to show similar result can be applied to sets with lower bounds. Here's how I did it:

Let $-S = \{-s|s \in S\}$. Suppose $-S$ has an upper bound, then $-S$ must have a least upper bound, namely, $L \in \mathbb{R}$. Hence, $\forall -s \in -S$, $-s < L $ such that there's no $L'$ so that $-s-L'>-L$. But this implies $-s

Answer 1

It looks good except for one detail.

I would first say that if $L$ has a lower bound then that number multiplied by $-1$ is an upper bound for $-L$.

That way the proof is complete, namely that if $L$ has a lower bound then $L$ has a greatest lower bound.

Answer 2

Let $S$ be a set with upper bound. Then $S$ has the least upper bound, defined by $L$. Namely,

(1) For for $\forall x\in S$, $x\le L$;

(2) For $\forall \varepsilon>0$, there is $x\in S$ such that $L-\varepsilon

Thus

(1) For $\forall x\in -S$, then $-x\in S$ and hence $-x\le L$ or $x\ge -L$;

(2) For $\forall \varepsilon>0$, there is $t\in S$ such that $L-\varepsilon

Thus $-L$ is the largest lower bound of $-S$.