Theorem nfna1 2189

Description: A convenience theorem particularly designed to remove dependencies on ax-11 2194 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 2188	. 2 ⊢ Ⅎ𝑥∀𝑥𝜑
2	1	nfn 1890	1 ⊢ Ⅎ𝑥 ¬ ∀𝑥𝜑

This proof depends on syntax axioms:  ¬ wn 3  ∀wal 1568  Ⅎwnf 1816

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-10 2178

This proof depends on definitions:  df-bi 210  df-or 862  df-ex 1813  df-nf 1817

This theorem is used by:  dvelimhw  2376  nfeqf  2412  equs5  2491  sb4b  2506  nfsb2  2514  dvelimalcased  35571  dvelimexcased  35573  regsfromsetind  37145  wl-equsb3  38306  wl-sbcom2d-lem1  38309  wl-euequf  38324