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

Theorem nfmo1 2557
Description: Bound-variable hypothesis builder for the at-most-one quantifier. (Contributed by NM, 8-Mar-1995.) (Revised by Mario Carneiro, 7-Oct-2016.) Adapt to new definition. (Revised by BJ, 1-Oct-2022.)
Assertion
Ref Expression
nfmo1 𝑥∃*𝑥𝜑

Proof of Theorem nfmo1
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 dfmo 2540 . 2 (∃*𝑥𝜑 ↔ ∃𝑦𝑥(𝜑𝑥 = 𝑦))
2 nfexa2 2183 . 2 𝑥𝑦𝑥(𝜑𝑥 = 𝑦)
31, 2nfxfr 1854 1 𝑥∃*𝑥𝜑
Colors of variables: wff setvar class
Syntax hints:  wi 4  wal 1539  wex 1780  wnf 1784  ∃*wmo 2537
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-10 2146  ax-11 2162
This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1781  df-nf 1785  df-mo 2539
This theorem is referenced by:  mo3  2564  nfeu1  2589  moanmo  2622  moexexlem  2626  mopick2  2637  2mo  2648  2eu3  2654  nfrmo1  3377  mob  3675  morex  3677  wl-mo3t  37781  permaxrep  45257
  Copyright terms: Public domain W3C validator