Theorem nfmov 2590

Description: Bound-variable hypothesis builder for the at-most-one quantifier. See nfmo 2592 for a version without disjoint variable conditions but requiring ax-13 2406. (Contributed by NM, 9-Mar-1995.) (Revised by Wolf Lammen, 2-Oct-2023.)

Hypothesis

Ref	Expression
nfmov.1	⊢ Ⅎ𝑥𝜑

Assertion

Ref	Expression
nfmov	⊢ Ⅎ𝑥∃*𝑦𝜑

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem nfmov

Step	Hyp	Ref	Expression
1		nftru 1837	. . 3 ⊢ Ⅎ𝑦⊤
2		nfmov.1	. . . 4 ⊢ Ⅎ𝑥𝜑
3	2	a1i 11	. . 3 ⊢ (⊤ → Ⅎ𝑥𝜑)
4	1, 3	nfmodv 2589	. 2 ⊢ (⊤ → Ⅎ𝑥∃*𝑦𝜑)
5	4	mptru 1577	1 ⊢ Ⅎ𝑥∃*𝑦𝜑

This proof depends on syntax axioms:  ⊤wtru 1571  Ⅎwnf 1816  ∃*wmo 2567

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 2179  ax-11 2195  ax-12 2216

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-mo 2569

This theorem is used by:  mo3  2594  2moexv  2657  moexexvw  2658  2moswapv  2659  2euexv  2661  2mo  2678  nfrmow  3400  reusv1  5370  reusv2lem1  5371  mosubopt  5495  dffun6f  6555