 This holds if and only if there are at least two elements that are in \(x\) and not in \(y\). We can write this in turn as: The number of elements in \(x\) and not in \(y\) is not 0 and is not 1; which is a boolean combination of allowed formulas. The general proof is very similar but more complicated.