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

Theorem nfmo1 2558
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 2541 . 2 (∃*𝑥𝜑 ↔ ∃𝑦𝑥(𝜑𝑥 = 𝑦))
2 nfexa2 2184 . 2 𝑥𝑦𝑥(𝜑𝑥 = 𝑦)
31, 2nfxfr 1855 1 𝑥∃*𝑥𝜑
Colors of variables: wff setvar class
Syntax hints:  wi 4  wal 1540  wex 1781  wnf 1785  ∃*wmo 2538
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-10 2147  ax-11 2163
This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1782  df-nf 1786  df-mo 2540
This theorem is referenced by:  mo3  2565  nfeu1  2590  moanmo  2623  moexexlem  2627  mopick2  2638  2mo  2649  2eu3  2655  nfrmo1  3379  mob  3677  morex  3679  wl-mo3t  37831  permaxrep  45362
  Copyright terms: Public domain W3C validator