Metamath Proof Explorer


Theorem nfmod

Description: Bound-variable hypothesis builder for the at-most-one quantifier. Deduction version of nfmo . Usage of this theorem is discouraged because it depends on ax-13 . Use the weaker nfmodv when possible. (Contributed by Mario Carneiro, 14-Nov-2016) (New usage is discouraged.)

Ref Expression
Hypotheses nfmod.1 ⊢ Ⅎ y φ
nfmod.2 ⊢ φ → Ⅎ x ψ
Assertion nfmod ⊢ φ → Ⅎ x ∃* y ψ

Proof

Step Hyp Ref Expression
1 nfmod.1 ⊢ Ⅎ y φ
2 nfmod.2 ⊢ φ → Ⅎ x ψ
3 2 adantr ⊢ φ ∧ ¬ ∀ x x = y → Ⅎ x ψ
4 1 3 nfmod2 ⊢ φ → Ⅎ x ∃* y ψ