Theorem bj-alequex 36769

Description: A fol lemma. See alequexv 2001 for a version with a disjoint variable condition requiring fewer axioms. Can be used to reduce the proof of spimt 2385 from 133 to 112 bytes. (Contributed by BJ, 6-Oct-2018.)

Assertion

Ref	Expression
bj-alequex	⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → ∃𝑥𝜑)

Proof of Theorem bj-alequex

Step	Hyp	Ref	Expression
1		ax6e 2382	. 2 ⊢ ∃𝑥 𝑥 = 𝑦
2		exim 1834	. 2 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → (∃𝑥 𝑥 = 𝑦 → ∃𝑥𝜑))
3	1, 2	mpi 20	1 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → ∃𝑥𝜑)

Syntax hints:   → wi 4  ∀wal 1538  ∃wex 1779

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-12 2178  ax-13 2371

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

This theorem is referenced by:  bj-spimt2  36770  bj-equsal1t  36807