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

Theorem nfmo1 2583
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 2566 . 2 (∃*𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))
2 nfexa2 2212 . 2 Ⅎ𝑥∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦)
31, 2nfxfr 1886 1 Ⅎ𝑥∃*𝑥𝜑
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4  ∀wal 1568  ∃wex 1812  Ⅎwnf 1816  ∃*wmo 2563
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-10 2178  ax-11 2194
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-nf 1817  df-mo 2565
This theorem is used by:  mo3  2590  nfeu1  2615  moanmo  2648  moexexlem  2652  mopick2  2663  2mo  2674  2eu3  2679  nfrmo1  3393  mob  3675  morex  3677  wl-mo3t  38508  permaxrep  45995
  Copyright terms: Public domain W3C validator