Theorem equsexhv 2289

Description: An equivalence related to implicit substitution. Version of equsexh 2421 with a disjoint variable condition, which does not require ax-13 2372. (Contributed by NM, 5-Aug-1993.) (Revised by BJ, 31-May-2019.)

Hypotheses

Ref	Expression
equsalhw.1	⊢ (𝜓 → ∀𝑥𝜓)
equsalhw.2	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
equsexhv	⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ 𝜓)

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑥,𝑦)

Proof of Theorem equsexhv

Step	Hyp	Ref	Expression
1		equsalhw.1	. . 3 ⊢ (𝜓 → ∀𝑥𝜓)
2	1	nf5i 2142	. 2 ⊢ Ⅎ𝑥𝜓
3		equsalhw.2	. 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
4	2, 3	equsexv 2260	1 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ 𝜓)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396  ∀wal 1537  ∃wex 1782

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-10 2137  ax-12 2171

This theorem depends on definitions:  df-bi 206  df-an 397  df-ex 1783  df-nf 1787

This theorem is referenced by:  cleljustALT  2362