A similar question: Distance of two sets and their closest points
The question above, however, defines distance differently. The definition we work under is:
$$\operatorname{dist}(A, B)=\inf\{d(a,b):a \in A, b \in B\}$$
Informally, this must be true. Imagine two open unit discs, $A$ and $B$, centered about $-1$ and $1$ respectively. Notice that the distance $\operatorname{dist}(A, B) = 0$. Even though $A \cap B = \emptyset$, $\partial{A} \cap \partial{B} = \{0, 0\} \neq \emptyset$.
I'm not really sure how to prove this formally, though. Can anyone lend a hint? Is there anything in the informal concept that can be used in proof?
$$\operatorname{dist}(A, B) = 0 \land A \cap B = \emptyset \stackrel{?}{\implies} \partial A \cap \partial B \neq \emptyset$$