Theorem equs4 2446

Description: Lemma used in proofs of implicit substitution properties. The converse requires either a disjoint variable condition (sbalex 2279) or a nonfreeness hypothesis (equs45f 2489). Usage of this theorem is discouraged because it depends on ax-13 2402. See equs4v 2033 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 2413	. 2 ⊢ ∃𝑥 𝑥 = 𝑦
2		exintr 1925	. 2 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → (∃𝑥 𝑥 = 𝑦 → ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)))
3	1, 2	mpi 21	1 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → ∃𝑥(𝑥 = 𝑦 ∧ 𝜑))

This proof depends on syntax axioms:   → wi 4   ∧ 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-12 2213  ax-13 2402

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

This theorem is used by:  equsex  2448  equs45f  2489  equs5  2490  bj-sbsb  37749