Metamath Proof Explorer


Theorem cbvmovw

Description: Change bound variable. Uses only Tarski's FOL axiom schemes. See cbvmo and cbvmow for versions with fewer disjoint variable conditions but requiring more axioms. (Contributed by NM, 9-Mar-1995) (Revised by GG, 30-Sep-2024)

Ref Expression
Hypothesis cbvmovw.1 x=yφψ
Assertion cbvmovw *xφ*yψ

Proof

Step Hyp Ref Expression
1 cbvmovw.1 x=yφψ
2 equequ1 x=yx=zy=z
3 1 2 imbi12d x=yφx=zψy=z
4 3 cbvalvw xφx=zyψy=z
5 4 exbii zxφx=zzyψy=z
6 df-mo *xφzxφx=z
7 df-mo *yψzyψy=z
8 5 6 7 3bitr4i *xφ*yψ