Theorem equs4 2434

Description: Lemma used in proofs of implicit substitution properties. The converse requires either a disjoint variable condition (sb56 2273) or a non-freeness hypothesis (equs45f 2478). Usage of this theorem is discouraged because it depends on ax-13 2386. 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 2397	. 2 ⊢ ∃𝑥 𝑥 = 𝑦
2		exintr 1889	. 2 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → (∃𝑥 𝑥 = 𝑦 → ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)))
3	1, 2	mpi 20	1 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → ∃𝑥(𝑥 = 𝑦 ∧ 𝜑))

Syntax hints:   → wi 4   ∧ wa 398  ∀wal 1531  ∃wex 1776

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-12 2173  ax-13 2386

This theorem depends on definitions:  df-bi 209  df-an 399  df-ex 1777

This theorem is referenced by:  equsex  2436  equs45f  2478  equs5  2479  sb1OLD  2503  sb2ALT  2583  bj-sbsb  34160