I have found a surprisingly easy proof of this conjecture which I proposed yesterday.
Theorem Let be a set of binary relations. If for every
we have
then there exists a funcoid
such that
.
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.