Theorem nfmo 2640

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 2384. Use the weaker nfmov 2638 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 1799	. . 3 ⊢ Ⅎ𝑦⊤
2		nfmo.1	. . . 4 ⊢ Ⅎ𝑥𝜑
3	2	a1i 11	. . 3 ⊢ (⊤ → Ⅎ𝑥𝜑)
4	1, 3	nfmod 2639	. 2 ⊢ (⊤ → Ⅎ𝑥∃*𝑦𝜑)
5	4	mptru 1538	1 ⊢ Ⅎ𝑥∃*𝑦𝜑

Syntax hints:  ⊤wtru 1532  Ⅎwnf 1778  ∃*wmo 2614

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-10 2139  ax-11 2154  ax-12 2170  ax-13 2384

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1534  df-ex 1775  df-nf 1779  df-mo 2616

This theorem is referenced by:  moexex  2717  2moex  2719  2euex  2720