MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nfna1 Structured version   Unicode version

Theorem nfna1 1959
Description: A convenience theorem particularly designed to remove dependencies on ax-11 1893 in conjunction with disjunctors. (Contributed by Wolf Lammen, 2-Sep-2018.)
Assertion
Ref Expression
nfna1  |-  F/ x  -.  A. x ph

Proof of Theorem nfna1
StepHypRef Expression
1 nfa1 1953 . 2  |-  F/ x A. x ph
21nfn 1957 1  |-  F/ x  -.  A. x ph
Colors of variables: wff setvar class
Syntax hints:   -. wn 3   A.wal 1436   F/wnf 1664
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1666  ax-4 1679  ax-5 1749  ax-6 1795  ax-7 1840  ax-10 1888  ax-12 1906
This theorem depends on definitions:  df-bi 189  df-ex 1661  df-nf 1665
This theorem is referenced by:  dvelimhw  2012  nfeqf  2101  equs5  2146  nfsb2  2154  bj-equs5v  31325  bj-nfsb2v  31333  wl-equsb3  31842  wl-sbcom2d-lem1  31847  wl-ax11-lem3  31875  wl-ax11-lem4  31876  wl-ax11-lem6  31878  wl-ax11-lem7  31879
  Copyright terms: Public domain W3C validator