Metamath Proof Explorer


Theorem sbied

Description: Conversion of implicit substitution to explicit substitution (deduction version of sbie ) Usage of this theorem is discouraged because it depends on ax-13 . See sbiedw , sbiedvw for variants using disjoint variables, but requiring fewer axioms. (Contributed by NM, 30-Jun-1994) (Revised by Mario Carneiro, 4-Oct-2016) (Proof shortened by Wolf Lammen, 24-Jun-2018) (New usage is discouraged.)

Ref Expression
Hypotheses sbied.1 xφ
sbied.2 φxχ
sbied.3 φx=yψχ
Assertion sbied φyxψχ

Proof

Step Hyp Ref Expression
1 sbied.1 xφ
2 sbied.2 φxχ
3 sbied.3 φx=yψχ
4 1 sbrim yxφψφyxψ
5 1 2 nfim1 xφχ
6 3 com12 x=yφψχ
7 6 pm5.74d x=yφψφχ
8 5 7 sbie yxφψφχ
9 4 8 bitr3i φyxψφχ
10 9 pm5.74ri φyxψχ