fv-nalx

Theorem.

Arguments:

x (sv), phi (pr),

Assertions:

(x bound in lnotforallxphi)

Proof:

Hyp Ref Line Expr
bv-∀b1(x bound in forallxphi)
1bv-¬2(x bound in lnotforallxphi)