Theorem nfna1 2149

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

Assertion

Ref	Expression
nfna1	⊢ Ⅎ𝑥 ¬ ∀𝑥𝜑

Proof of Theorem nfna1

Step	Hyp	Ref	Expression
1		nfa1 2148	. 2 ⊢ Ⅎ𝑥∀𝑥𝜑
2	1	nfn 1860	1 ⊢ Ⅎ𝑥 ¬ ∀𝑥𝜑

Syntax hints:  ¬ wn 3  ∀wal 1539  Ⅎwnf 1785

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-10 2137

This theorem depends on definitions:  df-bi 206  df-or 846  df-ex 1782  df-nf 1786

This theorem is referenced by:  dvelimhw  2342  nfeqf  2380  equs5  2459  sb4b  2474  nfsb2  2486  ab0OLD  4326  wl-equsb3  35867  wl-sbcom2d-lem1  35870  wl-euequf  35885  wl-ax11-lem3  35894  wl-ax11-lem4  35895  wl-ax11-lem6  35897  wl-ax11-lem7  35898