I'm working on a software problem and trying to describe it in symbolic logic so that I can get my head around it.
I have
$isnt(n) := \mathbf{F} \neq \emptyset \wedge \forall f \in \mathbf{F} : P(n,f) $
Basically, I'm checking n against all elements in F, unless F is empty.
Is there a way to simplify this so as to have no conjunctions (or disjunctions) outside of the quantifiers