Metamath Proof Explorer


Theorem equsexvw

Description: Version of equsexv with a disjoint variable condition, and of equsex with two disjoint variable conditions, which requires fewer axioms. See also the dual form equsalvw . (Contributed by BJ, 31-May-2019) (Proof shortened by Wolf Lammen, 23-Oct-2023)

Ref Expression
Hypothesis equsalvw.1 x=yφψ
Assertion equsexvw xx=yφψ

Proof

Step Hyp Ref Expression
1 equsalvw.1 x=yφψ
2 alinexa xx=y¬φ¬xx=yφ
3 1 notbid x=y¬φ¬ψ
4 3 equsalvw xx=y¬φ¬ψ
5 2 4 bitr3i ¬xx=yφ¬ψ
6 5 con4bii xx=yφψ