Let $A$ and $B$ two subsets of $\mathbb{R}$ such that : $A \cup B = \mathbb{R}$ and $A \cap B = \emptyset$.
We suppose that $A$ has a supremum that we denote $\alpha$ , and $B$ has an infimum that we denote $\beta$.
Show that $\alpha = \beta$
My attempt :
By definition of the sup :
$\forall \epsilon > 0 : \alpha + \epsilon \notin A$
So :
$\forall \epsilon > 0 : \alpha + \epsilon \in B \ \Longrightarrow \forall \epsilon > 0 : \alpha + \epsilon \geq b$
Hence $ \alpha \geq \beta $
I've been stuck for the past hours on how to achieve the second part of the inequality (i.e $\alpha \leq \beta$ )
Any help is appreciated.