Theorem nfmo 2550

Description: Bound-variable hypothesis builder for the at-most-one quantifier. Note that 𝑥 and 𝑦 need not be disjoint. Usage of this theorem is discouraged because it depends on ax-13 2365. Use the weaker nfmov 2548 when possible. (Contributed by NM, 9-Mar-1995.) (New usage is discouraged.)

Hypothesis

Ref	Expression
nfmo.1	⊢ Ⅎ𝑥𝜑

Assertion

Ref	Expression
nfmo	⊢ Ⅎ𝑥∃*𝑦𝜑

Proof of Theorem nfmo

Step	Hyp	Ref	Expression
1		nftru 1798	. . 3 ⊢ Ⅎ𝑦⊤
2		nfmo.1	. . . 4 ⊢ Ⅎ𝑥𝜑
3	2	a1i 11	. . 3 ⊢ (⊤ → Ⅎ𝑥𝜑)
4	1, 3	nfmod 2549	. 2 ⊢ (⊤ → Ⅎ𝑥∃*𝑦𝜑)
5	4	mptru 1540	1 ⊢ Ⅎ𝑥∃*𝑦𝜑

Syntax hints:  ⊤wtru 1534  Ⅎwnf 1777  ∃*wmo 2526

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-10 2129  ax-11 2146  ax-12 2166  ax-13 2365

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-tru 1536  df-ex 1774  df-nf 1778  df-mo 2528

This theorem is referenced by:  moexex  2626  2moex  2628  2euex  2629