I have found a surprisingly easy proof of this conjecture which I proposed yesterday.

**Theorem** Let $latex S$ be a set of binary relations. If for every $latex X, Y \in S$ we have $latex \mathrm{up} (X \sqcap^{\mathsf{FCD}} Y) \subseteq S$ then there exists a funcoid $latex f$ such that $latex S = \mathrm{up}\, f$.

The proof (currently available in this PDF file) is based on “Funcoids are filters” chapter of my book.

Oops, my proof is erroneous. I hope to salvage the proof, however.