Metamath Proof Explorer


Theorem bj-nfs1

Description: Shorter proof of nfs1 (three essential steps instead of four). (Contributed by BJ, 2-May-2019) (Proof modification is discouraged.)

Ref Expression
Hypothesis bj-nfs1.nf ⊢ Ⅎ y φ
Assertion bj-nfs1 ⊢ Ⅎ x y x φ

Proof

Step Hyp Ref Expression
1 bj-nfs1.nf ⊢ Ⅎ y φ
2 bj-nfs1t2 ⊢ ∀ x Ⅎ y φ → Ⅎ x y x φ
3 2 1 mpg ⊢ Ⅎ x y x φ