Metamath Proof Explorer


Theorem cbvrexsv

Description: Change bound variable by using a substitution. Usage of this theorem is discouraged because it depends on ax-13 . Use the weaker cbvrexsvw when possible. (Contributed by NM, 2-Mar-2008) (Revised by Andrew Salmon, 11-Jul-2011) (New usage is discouraged.)

Ref Expression
Assertion cbvrexsv ⊢ ∃ x ∈ A φ ↔ ∃ y ∈ A y x φ

Proof

Step Hyp Ref Expression
1 nfv ⊢ Ⅎ z φ
2 nfs1v ⊢ Ⅎ x z x φ
3 sbequ12 ⊢ x = z → φ ↔ z x φ
4 1 2 3 cbvrex ⊢ ∃ x ∈ A φ ↔ ∃ z ∈ A z x φ
5 nfv ⊢ Ⅎ y φ
6 5 nfsb ⊢ Ⅎ y z x φ
7 nfv ⊢ Ⅎ z y x φ
8 sbequ ⊢ z = y → z x φ ↔ y x φ
9 6 7 8 cbvrex ⊢ ∃ z ∈ A z x φ ↔ ∃ y ∈ A y x φ
10 4 9 bitri ⊢ ∃ x ∈ A φ ↔ ∃ y ∈ A y x φ