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

Theorem nfmo 2587
Description: Bound-variable hypothesis builder for the at-most-one quantifier. Note that 𝑥 and 𝑦 need not be disjoint. Usage of this theorem is discouraged because it depends on ax-13 2401. Use the weaker nfmov 2585 when possible. (Contributed by NM, 9-Mar-1995.) (New usage is discouraged.)
Hypothesis
Ref Expression
nfmo.1 Ⅎ𝑥𝜑
Assertion
Ref Expression
nfmo Ⅎ𝑥∃*𝑦𝜑

Proof of Theorem nfmo
StepHypRef Expression
1 nftru 1836 . . 3 Ⅎ𝑦⊤
2 nfmo.1 . . . 4 Ⅎ𝑥𝜑
32a1i 11 . . 3 (⊤ → Ⅎ𝑥𝜑)
41, 3nfmod 2586 . 2 (⊤ → Ⅎ𝑥∃*𝑦𝜑)
54mptru 1576 1 Ⅎ𝑥∃*𝑦𝜑
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ⊤wtru 1570  Ⅎwnf 1815  ∃*wmo 2562
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-10 2177  ax-11 2193  ax-12 2212  ax-13 2401
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-mo 2564
This theorem is used by:  moexex  2663  2moex  2665  2euex  2666
  Copyright terms: Public domain W3C validator