Theorem equs5a 2491

Description: A property related to substitution that unlike equs5 2494 does not require a distinctor antecedent. Usage of this theorem is discouraged because it depends on ax-13 2406. This proof uses ax12 2457, see equs5aALT 2400 for an alternative one using ax-12 2216 but not ax13 2409. Usage of the weaker equs5av 2314 is preferred, which uses ax12v2 2218, but not ax-13 2406. (Contributed by NM, 2-Feb-2007.) (New usage is discouraged.)

Assertion

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

Proof of Theorem equs5a

Step	Hyp	Ref	Expression
1		nfa1 2189	. 2 ⊢ Ⅎ𝑥∀𝑥(𝑥 = 𝑦 → 𝜑)
2		ax12 2457	. . 3 ⊢ (𝑥 = 𝑦 → (∀𝑦𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)))
3	2	imp 412	. 2 ⊢ ((𝑥 = 𝑦 ∧ ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦 → 𝜑))
4	1, 3	exlimi 2256	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-10 2179  ax-12 2216  ax-13 2406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1813  df-nf 1817

This theorem is used by:  equs45f  2493