MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nf6 Structured version   Visualization version   GIF version

Theorem nf6 2103
Description: An alternate definition of df-nf 1701. (Contributed by Mario Carneiro, 24-Sep-2016.)
Assertion
Ref Expression
nf6 (Ⅎ𝑥𝜑 ↔ ∀𝑥(∃𝑥𝜑𝜑))

Proof of Theorem nf6
StepHypRef Expression
1 df-nf 1701 . 2 (Ⅎ𝑥𝜑 ↔ (∃𝑥𝜑 → ∀𝑥𝜑))
2 nfe1 2014 . . 3 𝑥𝑥𝜑
3219.21 2062 . 2 (∀𝑥(∃𝑥𝜑𝜑) ↔ (∃𝑥𝜑 → ∀𝑥𝜑))
41, 3bitr4i 266 1 (Ⅎ𝑥𝜑 ↔ ∀𝑥(∃𝑥𝜑𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wal 1473  wex 1695  wnf 1699
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-12 2034
This theorem depends on definitions:  df-bi 196  df-ex 1696  df-nf 1701
This theorem is referenced by:  eusv2nf  4790  xfree  28687
  Copyright terms: Public domain W3C validator