Metamath Proof Explorer


Theorem sbtvOLD

Description: Obsolete version of sbt as of 6-Jul-2023. A substitution into a theorem yields a theorem. See sbt when x , y need not be disjoint. (Contributed by BJ, 31-May-2019) Reduce axioms. (Revised by Steven Nguyen, 25-Apr-2023) (New usage is discouraged.) (Proof modification is discouraged.)

Ref Expression
Hypothesis sbtvOLD.1 φ
Assertion sbtvOLD x y φ

Proof

Step Hyp Ref Expression
1 sbtvOLD.1 φ
2 1 a1i y = x φ
3 ax6ev y y = x
4 3 1 exan y y = x φ
5 dfsb1 x y φ y = x φ y y = x φ
6 2 4 5 mpbir2an x y φ