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 df-mo 2540 . 2 (∃*𝑥𝜑 ↔ ∃𝑦𝑥(𝜑𝑥 = 𝑦))
2 nfa1 2150 . . 3 𝑥𝑥(𝜑𝑥 = 𝑦)
32nfex 2322 . 2 𝑥𝑦𝑥(𝜑𝑥 = 𝑦)
41, 3nfxfr 1856 1 𝑥∃*𝑥𝜑
Colors of variables: wff setvar class
Syntax hints:  wi 4  wal 1537  wex 1783  wnf 1787  ∃*wmo 2538
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-10 2139  ax-11 2156  ax-12 2173
This theorem depends on definitions:  df-bi 206  df-or 844  df-ex 1784  df-nf 1788  df-mo 2540
This theorem is referenced by:  mo3  2564  nfeu1ALT  2589  moanmo  2624  moexexlem  2628  mopick2  2639  2mo  2650  2eu3  2655  nfrmo1  3297  mob  3647  morex  3649  wl-mo3t  35658
  Copyright terms: Public domain W3C validator