Theorem nfmov 2552

Description: Bound-variable hypothesis builder for the at-most-one quantifier. See nfmo 2554 for a version without disjoint variable conditions but requiring ax-13 2369. (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 1804	. . 3 ⊢ Ⅎ𝑦⊤
2		nfmov.1	. . . 4 ⊢ Ⅎ𝑥𝜑
3	2	a1i 11	. . 3 ⊢ (⊤ → Ⅎ𝑥𝜑)
4	1, 3	nfmodv 2551	. 2 ⊢ (⊤ → Ⅎ𝑥∃*𝑦𝜑)
5	4	mptru 1546	1 ⊢ Ⅎ𝑥∃*𝑦𝜑

Syntax hints:  ⊤wtru 1540  Ⅎwnf 1783  ∃*wmo 2530

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-10 2135  ax-11 2152  ax-12 2169

This theorem depends on definitions:  df-bi 206  df-or 844  df-tru 1542  df-ex 1780  df-nf 1784  df-mo 2532

This theorem is referenced by:  mo3  2556  2moexv  2621  moexexvw  2622  2moswapv  2623  2euexv  2625  2mo  2642  nfrmow  3407  reusv1  5396  reusv2lem1  5397  mosubopt  5511  dffun6f  6562