Let $P$ be a countably infinite set of propositional variables and $\mathcal{L}_P$ be the propositional language generated from $P$ and the usual connectives $\wedge$, $\neg$, $\vee$. The set $\mathcal{W}_P$ denotes the set of all propositional interpretations on $P$. Given a set of formulae $\Phi \subseteq \mathcal{L}_P$, $[\Phi]$ denotes the set of interpretations that are models of all formulae from $\Phi$.
We consider the Stone topology $S$ on $\mathcal{W}_P$ defined as the topology with the basis $$\{[\{\varphi\}] \mid \varphi \in \mathcal{L}_P\}.$$
Remark 1: $x \in S$ is closed iff $x = [\Phi]$ for some $\Phi \subseteq \mathcal{L}_P$
Remark 2: $x \in S$ is closed and open iff $x = [\Phi]$ for some finite $\Phi \subseteq \mathcal{L}_P$.
Let $Clop(S)$ be the set of clopen sets of $S$, and $(X, \subset)$ be a subset of $Clop(S)$ strictly ordered by inclusion.
I am interested in the following property:
Property $P$. For each $z \in Clop(S)$, if there exists $x \in X$ such that $x \cap z \neq \emptyset$, then there also exists a smallest $y \in X$ (smallest w.r.t. $\subset$) such that $y \cap z \neq \emptyset$.
Is there a condition on $(X, \subset)$ which captures property $P$ above? That is, a condition on $(X, \subset)$ whose statement does not mention any element outside of $X$?
For instance, $(X, \subset)$ being a well-order is a too strong condition.
I am not an expert in topology, and in absence of a definite answer I would be glad to hear suggestions on where to look at.