One more conjecture about provability without axiom of choice

I addition to this conjecture I formulate one more similar conjecture: Conjecture $latex a\setminus^{\ast} b = a\#b$ for arbitrary filters $latex a$ and $latex b$ on a powerset cannot be proved in ZF (without axiom of choice). Notation (where $latex \mathfrak{F}$ is the set of filters on a powerset ordered reverse to set-theoretic inclusion): $latex […]