Metamath Proof Explorer


Theorem nfmo

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

Ref Expression
Hypothesis nfmo.1 ⊢ Ⅎ 𝑥 𝜑
Assertion nfmo Ⅎ 𝑥 ∃* 𝑦 𝜑

Proof

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