Theorem equsalh 2420

Description: An equivalence related to implicit substitution. Usage of this theorem is discouraged because it depends on ax-13 2372. See equsalhw 2288 for a version with a disjoint variable condition requiring fewer axioms. (Contributed by NM, 2-Jun-1993.) (New usage is discouraged.)

Hypotheses

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

Assertion

Ref	Expression
equsalh	⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) ↔ 𝜓)

Proof of Theorem equsalh

Step	Hyp	Ref	Expression
1		equsalh.1	. . 3 ⊢ (𝜓 → ∀𝑥𝜓)
2	1	nf5i 2142	. 2 ⊢ Ⅎ𝑥𝜓
3		equsalh.2	. 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
4	2, 3	equsal 2417	1 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) ↔ 𝜓)

Syntax hints:   → wi 4   ↔ wb 205  ∀wal 1537

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  ax-13 2372

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

This theorem is referenced by:  dvelimf-o  36943