Theorem equs4v 1999

Description: Version of equs4 2424 with a disjoint variable condition, which requires fewer axioms. (Contributed by NM, 10-May-1993.) (Revised by BJ, 31-May-2019.)

Assertion

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

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem equs4v

Step	Hyp	Ref	Expression
1		ax6ev 1969	. 2 ⊢ ∃𝑥 𝑥 = 𝑦
2		exintr 1891	. 2 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → (∃𝑥 𝑥 = 𝑦 → ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)))
3	1, 2	mpi 20	1 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → ∃𝑥(𝑥 = 𝑦 ∧ 𝜑))

Syntax hints:   → wi 4   ∧ wa 395  ∀wal 1535  ∃wex 1777

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-6 1967

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1778

This theorem is referenced by:  sb1v  2087  sbalex  2243  sbalexOLD  2244  equsexv  2269  bj-subst  36627  bj-equs45fv  36777