Metamath Proof Explorer


Theorem equsalv

Description: An equivalence related to implicit substitution. Version of equsal with a disjoint variable condition, which does not require ax-13 . See equsalvw for a version with two disjoint variable conditions requiring fewer axioms. See also the dual form equsexv . (Contributed by NM, 2-Jun-1993) (Revised by BJ, 31-May-2019)

Ref Expression
Hypotheses equsalv.nf ⊢ Ⅎ x ψ
equsalv.1 ⊢ x = y → φ ↔ ψ
Assertion equsalv ⊢ ∀ x x = y → φ ↔ ψ

Proof

Step Hyp Ref Expression
1 equsalv.nf ⊢ Ⅎ x ψ
2 equsalv.1 ⊢ x = y → φ ↔ ψ
3 1 19.23 ⊢ ∀ x x = y → ψ ↔ ∃ x x = y → ψ
4 2 pm5.74i ⊢ x = y → φ ↔ x = y → ψ
5 4 albii ⊢ ∀ x x = y → φ ↔ ∀ x x = y → ψ
6 ax6ev ⊢ ∃ x x = y
7 6 a1bi ⊢ ψ ↔ ∃ x x = y → ψ
8 3 5 7 3bitr4i ⊢ ∀ x x = y → φ ↔ ψ