Theorem equs5a 2495

Description: A property related to substitution that unlike equs5 2498 does not require a distinctor antecedent. Usage of this theorem is discouraged because it depends on ax-13 2410. This proof uses ax12 2461, see equs5aALT 2404 for an alternative one using ax-12 2219 but not ax13 2413. Usage of the weaker equs5av 2318 is preferred, which uses ax12v2 2221, but not ax-13 2410. (Contributed by NM, 2-Feb-2007.) (New usage is discouraged.)

Assertion

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

Proof of Theorem equs5a

Step	Hyp	Ref	Expression
1		nfa1 2192	. 2 ⊢ Ⅎ𝑥∀𝑥(𝑥 = 𝑦 → 𝜑)
2		ax12 2461	. . 3 ⊢ (𝑥 = 𝑦 → (∀𝑦𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)))
3	2	imp 411	. 2 ⊢ ((𝑥 = 𝑦 ∧ ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦 → 𝜑))
4	1, 3	exlimi 2259	1 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦 → 𝜑))

Syntax hints:   → wi 4   ∧ wa 400  ∀wal 1565  ∃wex 1806

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-10 2182  ax-12 2219  ax-13 2410

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-ex 1807  df-nf 1811

This theorem is referenced by:  equs45f  2497