Theorem equs5e 2466

Description: A property related to substitution that unlike equs5 2468 does not require a distinctor antecedent. This proof uses ax12 2431, see equs5eALT 2375 for an alternative one using ax-12 2189 but not ax13 2383. Usage of this theorem is discouraged because it depends on ax-13 2380. (Contributed by NM, 2-Feb-2007.) (Proof shortened by Wolf Lammen, 15-Jan-2018.) (New usage is discouraged.)

Assertion

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

Proof of Theorem equs5e

Step	Hyp	Ref	Expression
1		nfa1 2162	. 2 ⊢ Ⅎ𝑥∀𝑥(𝑥 = 𝑦 → ∃𝑦𝜑)
2		ax12 2431	. . 3 ⊢ (𝑥 = 𝑦 → (∀𝑦∃𝑦𝜑 → ∀𝑥(𝑥 = 𝑦 → ∃𝑦𝜑)))
3		hbe1 2154	. . . 4 ⊢ (∃𝑦𝜑 → ∀𝑦∃𝑦𝜑)
4	3	19.23bi 2203	. . 3 ⊢ (𝜑 → ∀𝑦∃𝑦𝜑)
5	2, 4	impel 510	. 2 ⊢ ((𝑥 = 𝑦 ∧ 𝜑) → ∀𝑥(𝑥 = 𝑦 → ∃𝑦𝜑))
6	1, 5	exlimi 2229	1 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) → ∀𝑥(𝑥 = 𝑦 → ∃𝑦𝜑))

Syntax hints:   → wi 4   ∧ wa 396  ∀wal 1545  ∃wex 1786

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-10 2152  ax-12 2189  ax-13 2380

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-ex 1787  df-nf 1791

This theorem is referenced by:  sb4e  2493