In this question, one of the answer (by Dimitris) uses the following lemma.
Lemma. Let $A\subset \mathbb{R}^N$ be a convex set. Suppose $\text{Int}A \ne \emptyset$. If $x \in \text{Int} A$ and $y \in \text{Cl}A$, then $[x, y) \subset \text{Int}A$, where $$ [x,y) := \{y+\lambda(x-y)\mid\lambda\in(0,1]\}. $$
(I changed the statement in the case of $\mathbb{R}^N$ since it suffices for my purpose.)
I am having trouble in proving this lemma. Here is my attempt.
Pick any $x \in \text{Int} A$ and $y \in \text{Cl}A$. If $y \in \text{Int}A$, then the result follows because $A$ is convex and thus $\text{Int}A$ is as well. Suppose $y \in \text{Bdry}A:=\text{Cl}A \setminus \text{Int}A$. Pick any $z \in [x,y)$. Then, there exists $\lambda\in(0,1]$ such that $z = y + \lambda(x-y)$. If $z \notin \text{Int}A$, then $z\in \text{Bdry}A$ since $z \in \text{Cl}A$ by the convexity of $A$ and $\text{Cl} A$.
Although it is intuitively clear that $z,y\in\text{Bdry}A$ is a contradiction, how can I prove it?