Theorem nfna1 1903

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

Assertion

Ref	Expression
nfna1

Proof of Theorem nfna1

Step	Hyp	Ref	Expression
1		nfa1 1897	. 2
2	1	nfn 1901	1

Syntax hints:  -.wn 3  A.wal 1393  F/wnf 1616

This theorem is referenced by:  dvelimhw  1955  nfeqf  2045  equs5  2092  nfsb2  2100  wl-equsb3  30004  wl-sbcom2d-lem1  30009  wl-ax11-lem3  30027  wl-ax11-lem4  30028  wl-ax11-lem6  30030  wl-ax11-lem7  30031  bj-equs5v  34332  bj-nfsb2v  34340

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1618  ax-4 1631  ax-5 1704  ax-6 1747  ax-7 1790  ax-10 1837  ax-12 1854

This theorem depends on definitions:  df-bi 185  df-ex 1613  df-nf 1617