We can demote the least upper bound property to a theorem in a fairly intuitive way.
Let's define what a real number is.
I'm not going to start from first-order real axioms because we run into a problem here, namely that there are many possible mathematical objects that we can construct that satisfy the real axioms (some of which are countable), for instance the computable reals or, depending on what kind of structure of the reals we want to express, the algebraic numbers might count (but would exclude $\pi$ and $e$).
Instead, let's take a Dedekind cut.
This is equivalent to saying that a real number is equivalent to all the rational numbers smaller than it:
$$ \text{the interpretation of $r$ is intuitively $\{ x : x \in \mathbb{Q} \land x < r \}$ } $$
This is a little circular though since we haven't defined what a real number is yet.
So, let's define a Dedekind cut as a set of rationals $X$ subject to the following rules:
- Downward closed $ [\forall x \in X][\forall y \in \mathbb{Q}](y < x \to y \in X) $
- No maximum element $[\not\exists x \in X][\forall y \in X](y \le x)$
Note that the inequality here is strict, so $\left(\frac{1}{2}\right)_\mathbb{Q}$ is NOT an element of $\left(\frac{1}{2}\right)_\mathbb{R}$.
And let's also rule out the empty set (corresponding to $-\infty$) and $\mathbb{Q}$ itself (corresponding to $\infty$).
Now, with that out of the way, suppose we have a bounded set of reals $\mathcal{F}$.
We stare at $\mathcal{F}$ real hard and notice that it is a set of sets of rationals.
We then compute $X = \cup \mathcal{F}$, the union of all these sets of rationals.
Note that $X$ is a real number and also that $X$ is greater than or equal to any element of $\mathcal{F}$ (as a real number). Additionally, any real number strictly smaller than $X$ will leave behind a rational that's present in one of the elements of $\mathcal{F}$.
Thus, as desired, every bounded set of real numbers has a least upper bound.