Metamath Proof Explorer


Theorem spimfv

Description: Specialization, using implicit substitution. Version of spim with a disjoint variable condition, which does not require ax-13 . See spimvw for a version with two disjoint variable conditions, requiring fewer axioms, and spimv for another variant. (Contributed by NM, 10-Jan-1993) (Revised by BJ, 31-May-2019)

Ref Expression
Hypotheses spimfv.nf xψ
spimfv.1 x=yφψ
Assertion spimfv xφψ

Proof

Step Hyp Ref Expression
1 spimfv.nf xψ
2 spimfv.1 x=yφψ
3 ax6ev xx=y
4 3 2 eximii xφψ
5 1 4 19.36i xφψ