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

Theorem emptynf 1909
Description: On the empty domain, any variable is effectively nonfree in any formula. (Contributed by Wolf Lammen, 12-Mar-2023.)
Assertion
Ref Expression
emptynf (¬ ∃𝑥⊤ → Ⅎ𝑥𝜑)

Proof of Theorem emptynf
StepHypRef Expression
1 emptyal 1908 . 2 (¬ ∃𝑥⊤ → ∀𝑥𝜑)
2 nftht 1792 . 2 (∀𝑥𝜑 → Ⅎ𝑥𝜑)
31, 2syl 17 1 (¬ ∃𝑥⊤ → Ⅎ𝑥𝜑)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wal 1534  wtru 1537  wex 1779  wnf 1783
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809
This theorem depends on definitions:  df-bi 209  df-tru 1539  df-ex 1780  df-nf 1784
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator