Theorem equs4 2414

Description: Lemma used in proofs of implicit substitution properties. The converse requires either a disjoint variable condition (sbalex 2234) or a nonfreeness hypothesis (equs45f 2457). Usage of this theorem is discouraged because it depends on ax-13 2370. See equs4v 2002 for a weaker version requiring fewer axioms. (Contributed by NM, 10-May-1993.) (Proof shortened by Mario Carneiro, 20-May-2014.) (Proof shortened by Wolf Lammen, 5-Feb-2018.) (New usage is discouraged.)

Assertion

Ref	Expression
equs4	⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → ∃𝑥(𝑥 = 𝑦 ∧ 𝜑))

Proof of Theorem equs4

Step	Hyp	Ref	Expression
1		ax6e 2381	. 2 ⊢ ∃𝑥 𝑥 = 𝑦
2		exintr 1894	. 2 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → (∃𝑥 𝑥 = 𝑦 → ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)))
3	1, 2	mpi 20	1 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → ∃𝑥(𝑥 = 𝑦 ∧ 𝜑))

Syntax hints:   → wi 4   ∧ wa 395  ∀wal 1538  ∃wex 1780

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-12 2170  ax-13 2370

This theorem depends on definitions:  df-bi 206  df-an 396  df-ex 1781

This theorem is referenced by:  equsex  2416  equs45f  2457  equs5  2458  bj-sbsb  36031