Metamath Proof Explorer


Theorem cbvrmow

Description: Change the bound variable of a restricted at-most-one quantifier using implicit substitution. Version of cbvrmo with a disjoint variable condition, which does not require ax-13 . (Contributed by NM, 16-Jun-2017) (Revised by Gino Giotto, 10-Jan-2024)

Ref Expression
Hypotheses cbvrmow.1 y φ
cbvrmow.2 x ψ
cbvrmow.3 x = y φ ψ
Assertion cbvrmow * x A φ * y A ψ

Proof

Step Hyp Ref Expression
1 cbvrmow.1 y φ
2 cbvrmow.2 x ψ
3 cbvrmow.3 x = y φ ψ
4 1 2 3 cbvrexw x A φ y A ψ
5 1 2 3 cbvreuw ∃! x A φ ∃! y A ψ
6 4 5 imbi12i x A φ ∃! x A φ y A ψ ∃! y A ψ
7 rmo5 * x A φ x A φ ∃! x A φ
8 rmo5 * y A ψ y A ψ ∃! y A ψ
9 6 7 8 3bitr4i * x A φ * y A ψ