Theorem nfna1

Description: A convenience theorem particularly designed to remove dependencies on ax-11 in conjunction with distinctors. (Contributed by Wolf Lammen, 2-Sep-2018)

	Ref	Expression
Assertion	nfna1	$$⊢Ⅎx\neg \forall x\phi$$

Proof

Step	Hyp	Ref	Expression
1		nfa1	$$⊢Ⅎx\forall x\phi$$
2	1	nfn	$$⊢Ⅎx\neg \forall x\phi$$