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

Theorem nf2 1960
Description: An alternative definition of df-nf 1617, which does not involve nested quantifiers on the same variable. (Contributed by Mario Carneiro, 24-Sep-2016.)
Assertion
Ref Expression
nf2

Proof of Theorem nf2
StepHypRef Expression
1 df-nf 1617 . 2
2 nfa1 1897 . . 3
3219.23 1910 . 2
41, 3bitri 249 1
Colors of variables: wff setvar class
Syntax hints:  ->wi 4  <->wb 184  A.wal 1393  E.wex 1612  F/wnf 1616
This theorem is referenced by:  nf3  1961  nf4  1962  nfdiOLD  1963  nfeqf2  2041  equveliOLD  2089  sbnf2  2183  eusv2i  4649
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
  Copyright terms: Public domain W3C validator