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

Theorem nf3 1788
Description: Alternate definition of non-freeness. (Contributed by BJ, 16-Sep-2021.)
Assertion
Ref Expression
nf3 (Ⅎ𝑥𝜑 ↔ (∀𝑥𝜑 ∨ ∀𝑥 ¬ 𝜑))

Proof of Theorem nf3
StepHypRef Expression
1 nf2 1787 . 2 (Ⅎ𝑥𝜑 ↔ (∀𝑥𝜑 ∨ ¬ ∃𝑥𝜑))
2 alnex 1783 . . 3 (∀𝑥 ¬ 𝜑 ↔ ¬ ∃𝑥𝜑)
32orbi2i 910 . 2 ((∀𝑥𝜑 ∨ ∀𝑥 ¬ 𝜑) ↔ (∀𝑥𝜑 ∨ ¬ ∃𝑥𝜑))
41, 3bitr4i 281 1 (Ⅎ𝑥𝜑 ↔ (∀𝑥𝜑 ∨ ∀𝑥 ¬ 𝜑))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 209  wo 844  wal 1536  wex 1781  wnf 1785
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This theorem depends on definitions:  df-bi 210  df-or 845  df-ex 1782  df-nf 1786
This theorem is referenced by:  nf4  1789  nfnbi  1856  nfim1  2198  dfnf5  4291
  Copyright terms: Public domain W3C validator