Metamath Proof Explorer


Theorem equsexv

Description: An equivalence related to implicit substitution. Version of equsex with a disjoint variable condition, which does not require ax-13 . See equsexvw for a version with two disjoint variable conditions requiring fewer axioms. See also the dual form equsalv . (Contributed by NM, 5-Aug-1993) (Revised by BJ, 31-May-2019) Avoid ax-10 . (Revised by GG, 18-Nov-2024)

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

Proof

Step Hyp Ref Expression
1 equsalv.nf ⊢ Ⅎ x ψ
2 equsalv.1 ⊢ x = y → φ ↔ ψ
3 2 biimpa ⊢ x = y ∧ φ → ψ
4 1 3 exlimi ⊢ ∃ x x = y ∧ φ → ψ
5 1 2 equsalv ⊢ ∀ x x = y → φ ↔ ψ
6 equs4v ⊢ ∀ x x = y → φ → ∃ x x = y ∧ φ
7 5 6 sylbir ⊢ ψ → ∃ x x = y ∧ φ
8 4 7 impbii ⊢ ∃ x x = y ∧ φ ↔ ψ