I think the following property is necessary for the converse part of Theorem 4.2. (N-z) $\mathcal{U}_x\neq\emptyset$ for any $x\in X$. (Willard) I am reading "General Topology" by Stephen Willard.

I think the following property is necessary for the converse part of Theorem 4.2.

N-z) $\mathcal{U}_x\neq\emptyset$ for any $x\in X$.

I created a python program which computes the number of the functions $\mathcal{U}:X=\{0,1,\dots,n-1\}\to 2^X$ which satisfy N-a) through N-d).
But my python program didn't compute the correct answer.
Am I right?

Let $\mathcal{N}_x=\{U\subseteq X| U\in \mathcal{T}_X$ and $x\in U\}$. It’s easy to check $\mathcal{N}_x\neq \emptyset$, since $X\in \mathcal{N}_x$, for all $x\in X$.
