Theorem equsexhv 2330

Description: An equivalence related to implicit substitution. Version of equsexh 2456 with a disjoint variable condition, which does not require ax-13 2407. (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 2184	. 2 ⊢ Ⅎ𝑥𝜓
3		equsalhw.2	. 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
4	2, 3	equsexv 2307	1 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ 𝜓)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568  ∃wex 1812

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-10 2179  ax-12 2216

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-nf 1817

This theorem is used by:  cleljustALT  2399