Metamath Proof Explorer


Theorem cbvmovw

Description: Change bound variable. Uses only Tarski's FOL axiom schemes. See cbvmo for a version with fewer disjoint variable conditions but requiring more axioms. (Contributed by NM, 9-Mar-1995) (Revised by Gino Giotto, 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 df-mo * x φ z x φ x = z
3 equequ1 x = y x = z y = z
4 1 3 imbi12d x = y φ x = z ψ y = z
5 4 cbvalvw x φ x = z y ψ y = z
6 5 exbii z x φ x = z z y ψ y = z
7 df-mo * y ψ z y ψ y = z
8 7 bicomi z y ψ y = z * y ψ
9 2 6 8 3bitri * x φ * y ψ