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

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

Proof of Theorem nf3
StepHypRef Expression
1 nf2 1711 . 2 (Ⅎ𝑥𝜑 ↔ (∀𝑥𝜑 ∨ ¬ ∃𝑥𝜑))
2 alnex 1706 . . 3 (∀𝑥 ¬ 𝜑 ↔ ¬ ∃𝑥𝜑)
32orbi2i 541 . 2 ((∀𝑥𝜑 ∨ ∀𝑥 ¬ 𝜑) ↔ (∀𝑥𝜑 ∨ ¬ ∃𝑥𝜑))
41, 3bitr4i 267 1 (Ⅎ𝑥𝜑 ↔ (∀𝑥𝜑 ∨ ∀𝑥 ¬ 𝜑))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 196  wo 383  wal 1481  wex 1704  wnf 1708
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 197  df-or 385  df-ex 1705  df-nf 1710
This theorem is referenced by:  nf4  1713  nfntht2  1720  nfnbi  1781  nfntOLDOLD  1783  nfim1  2067
  Copyright terms: Public domain W3C validator