Suppose $\mathbb{R}^e=A \cup B$ in which $A \cap B=\varnothing$ and there exist real numbers $a_0$ and $b_0$ such that $a_0 \in A$ and $b_0 \in B$. My question is, can we construct $a \in A$ and $b \in B$ such that there exists a natural number $n$ such that $|a-b|<n$?
The restrictions is that I don't want to use the law of the excluded middle and the axiom of countable choice. My motivation is that $\mathbb{R}^e$, classical real numbers described by Troelstra and van Dalen in the book constructivism in mathematics, is not Archimedean. It is just weakly Archimedean that is:
$$ \forall x\in\mathbb{R}^e ~ \neg\neg\exists n\in \mathbb{N} ~ x<n. $$
What I already know about the problem is that, we can assume, without loss of generality, given any rational number $r$, $b_0+r \in B$. This is because either $b_0+r \in A$ or $b_0+r \in B$. If $b_0+r \in A$ we can solve the problem. So we can assume that $b_0+r \in B$.