Smallest neighbourhood characterization in finitely generated spaces To prove that finitely generated spaces are corecompact, I used the following characterisation of finitely generated topological spaces:

In a finitely generated topological space every point has a smallest
  neighbourhood.

Now I was wondering how to prove this characterisation. The definition I use for finitely generated topological spaces is the following:

$\forall A \in \mathcal{P}(X), \forall x \in X: x \in cl(A) \Rightarrow \exists a \in A, x \in cl\{a\}$

I tried proving it by contradiction: Assume that there is no such thing as a smallest neighbourhood. Suppose that $\forall V \in \mathcal{V}(x) \exists W \in \mathcal{V}(x); W \subseteq V$.
Can someone give me a hint so I can come to a contradiction? Or is there a nicer way to prove this?
As always, any hints or comments will be appreciated!

Let $U$ be the intersection of all neighborhoods of $x$. We show that $U$ is open. Let $y$ be in the closure of $X\backslash U$. We have to show that $y\in X\backslash U$. By assumption, there is $z\in X\backslash U$ such that $y$ is in the closure of $\{z\}$. Now by construction of $U$, there is an open neighborhood $V$ of $x$ such that $z\notin V$. Since $V$ is open, the closure of $\{z\}$ is not in $V$ and hence $y\notin V$. Hence $y\notin U$ and $y\in X\backslash U$. 
