Metamath Proof Explorer


Theorem cbvrmovw

Description: Change the bound variable of a restricted at-most-one quantifier using implicit substitution. Version of cbvrmov with a disjoint variable condition, which requires fewer axioms. (Contributed by NM, 16-Jun-2017) (Revised by Gino Giotto, 30-Sep-2024)

Ref Expression
Hypothesis cbvrmovw.1 x=yφψ
Assertion cbvrmovw *xAφ*yAψ

Proof

Step Hyp Ref Expression
1 cbvrmovw.1 x=yφψ
2 eleq1w x=yxAyA
3 2 1 anbi12d x=yxAφyAψ
4 3 cbvmovw *xxAφ*yyAψ
5 df-rmo *xAφ*xxAφ
6 df-rmo *yAψ*yyAψ
7 4 5 6 3bitr4i *xAφ*yAψ