Metamath Proof Explorer


Theorem cbvab

Description: Rule used to change bound variables, using implicit substitution. Usage of this theorem is discouraged because it depends on ax-13 . Usage of the weaker cbvabw and cbvabv are preferred. (Contributed by Andrew Salmon, 11-Jul-2011) (Proof shortened by Wolf Lammen, 16-Nov-2019) (New usage is discouraged.)

Ref Expression
Hypotheses cbvab.1 yφ
cbvab.2 xψ
cbvab.3 x=yφψ
Assertion cbvab x|φ=y|ψ

Proof

Step Hyp Ref Expression
1 cbvab.1 yφ
2 cbvab.2 xψ
3 cbvab.3 x=yφψ
4 1 sbco2 zyyxφzxφ
5 2 3 sbie yxφψ
6 5 sbbii zyyxφzyψ
7 4 6 bitr3i zxφzyψ
8 df-clab zx|φzxφ
9 df-clab zy|ψzyψ
10 7 8 9 3bitr4i zx|φzy|ψ
11 10 eqriv x|φ=y|ψ