Metamath Proof Explorer


Theorem cbvralv

Description: Change the bound variable of a restricted universal quantifier using implicit substitution. See cbvralvw based on fewer axioms , but extra disjoint variables. Usage of this theorem is discouraged because it depends on ax-13 . Use the weaker cbvralvw when possible. (Contributed by NM, 28-Jan-1997) (New usage is discouraged.)

Ref Expression
Hypothesis cbvralv.1 ⊢ x = y → φ ↔ ψ
Assertion cbvralv ⊢ ∀ x ∈ A φ ↔ ∀ y ∈ A ψ

Proof

Step Hyp Ref Expression
1 cbvralv.1 ⊢ x = y → φ ↔ ψ
2 nfv ⊢ Ⅎ y φ
3 nfv ⊢ Ⅎ x ψ
4 2 3 1 cbvral ⊢ ∀ x ∈ A φ ↔ ∀ y ∈ A ψ