I want to prove the following result:
Let $(X, d)$ be a metric space. Then $$\mathring E = \{x \in X \mid d(x, X \setminus E) > 0\}$$ where $d(x, A) = \inf\limits_{y \in A} d(x, y)$.
This is a part of my proof. But I'm not sure about a passage.
- $\mathring E \subseteq \{x \in X \mid d(x, X \setminus E) > 0\}$
Let $x \in \mathring E$. Then there exists $\varepsilon > 0$ such that $B(x, \varepsilon) \subset E$. We then have that, for every $y \in X \setminus E$, $$d(x, y) \geq \varepsilon > 0.$$ It follows that $d(x, X \setminus E) > 0$.
The other inclusion is much the same. The problem is that the bold passage seems so obvious, but I would like to prove it as well and I don't know how to do it.
How can I prove that if $d(x, a) < \varepsilon$ for every $a \in A$, then $d(x, b) \geq \varepsilon$ for every $b \in X \setminus A$?