Suppose $f, g$ are real-valued functions and $a, b$ are real numbers. If $f(x) \leq a \leq g(x)$ and $f(x) \leq b \leq g(x)$ for every $x \in \mathbb{R}$, and for all $\epsilon > 0$ there exists $x$ such that $g(x) - f(x) < \epsilon$, then $a = b$.
Is this result true? Something similar to it but involving lower and upper sums came up in a proof for the sum rule in integration ($\int_{a}^{b} (f + g) = \int_{a}^{b} f + \int_{a}^{b} g$) in Spivak's Calculus.
The result is true. Let $\epsilon > 0$, and choose $x \in \mathbb{R}$ such that:
$$ g(x) - f(x) < \epsilon $$
Remark that from your conditions, $g(x) \geq a$ and $-f(x) \geq -b$, so we have:
$$ \epsilon > g(x) - f(x) \geq a-b $$
Similarly, we have $g(x) \geq b$ and $-f(x) \geq -a$, so:
$$ \epsilon > g(x) - f(x) \geq b-a = -(a-b) $$
And so we have:
$$ |a-b| < \epsilon $$
Since this holds for any $\epsilon > 0$, we can conclude that $a=b$.