Theorem ax13lem2 2406

Description: Lemma for nfeqf2 2407. This lemma is equivalent to ax13v 2403 with one distinct variable constraint removed. (Contributed by Wolf Lammen, 8-Sep-2018.) Reduce axiom usage. (Revised by Wolf Lammen, 18-Oct-2020.) (New usage is discouraged.)

Assertion

Ref	Expression
ax13lem2	⊢ (¬ 𝑥 = 𝑦 → (∃𝑥 𝑧 = 𝑦 → 𝑧 = 𝑦))

Distinct variable group:   𝑥,𝑧

Proof of Theorem ax13lem2

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ax13lem1 2404	. . . 4 ⊢ (¬ 𝑥 = 𝑦 → (𝑤 = 𝑦 → ∀𝑥 𝑤 = 𝑦))
2		equeucl 2057	. . . . . 6 ⊢ (𝑧 = 𝑦 → (𝑤 = 𝑦 → 𝑧 = 𝑤))
3	2	eximi 1868	. . . . 5 ⊢ (∃𝑥 𝑧 = 𝑦 → ∃𝑥(𝑤 = 𝑦 → 𝑧 = 𝑤))
4		19.36v 2026	. . . . 5 ⊢ (∃𝑥(𝑤 = 𝑦 → 𝑧 = 𝑤) ↔ (∀𝑥 𝑤 = 𝑦 → 𝑧 = 𝑤))
5	3, 4	sylib 221	. . . 4 ⊢ (∃𝑥 𝑧 = 𝑦 → (∀𝑥 𝑤 = 𝑦 → 𝑧 = 𝑤))
6	1, 5	syl9 78	. . 3 ⊢ (¬ 𝑥 = 𝑦 → (∃𝑥 𝑧 = 𝑦 → (𝑤 = 𝑦 → 𝑧 = 𝑤)))
7	6	alrimdv 1962	. 2 ⊢ (¬ 𝑥 = 𝑦 → (∃𝑥 𝑧 = 𝑦 → ∀𝑤(𝑤 = 𝑦 → 𝑧 = 𝑤)))
8		equequ2 2059	. . 3 ⊢ (𝑤 = 𝑦 → (𝑧 = 𝑤 ↔ 𝑧 = 𝑦))
9	8	equsalvw 2037	. 2 ⊢ (∀𝑤(𝑤 = 𝑦 → 𝑧 = 𝑤) ↔ 𝑧 = 𝑦)
10	7, 9	imbitrdi 254	1 ⊢ (¬ 𝑥 = 𝑦 → (∃𝑥 𝑧 = 𝑦 → 𝑧 = 𝑦))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4  ∀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-13 2402

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813

This theorem is used by:  nfeqf2  2407  wl-speqv  38422  wl-19.2reqv  38424