Metamath Proof Explorer


Theorem cbvreuv

Description: Change the bound variable of a restricted unique existential quantifier using implicit substitution. See cbvreuvw for a version without ax-13 , but extra disjoint variables. Usage of this theorem is discouraged because it depends on ax-13 . Use the weaker cbvreuvw when possible. (Contributed by NM, 5-Apr-2004) (Revised by Mario Carneiro, 15-Oct-2016) (New usage is discouraged.)

Ref Expression
Hypothesis cbvrmov.1 ⊢ x = y → φ ↔ ψ
Assertion cbvreuv ⊢ ∃! x ∈ A φ ↔ ∃! y ∈ A ψ

Proof

Step Hyp Ref Expression
1 cbvrmov.1 ⊢ x = y → φ ↔ ψ
2 nfv ⊢ Ⅎ y φ
3 nfv ⊢ Ⅎ x ψ
4 2 3 1 cbvreu ⊢ ∃! x ∈ A φ ↔ ∃! y ∈ A ψ