Theorem wl-moteq 38279

Description: Change bound variable. Uses only Tarski's FOL axiom schemes. Part of Lemma 7 of [KalishMontague] p. 86. (Contributed by Wolf Lammen, 5-Mar-2023.)

Assertion

Ref	Expression
wl-moteq	⊢ (∃*𝑥⊤ → 𝑦 = 𝑧)

Proof of Theorem wl-moteq

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfmo 2567	. 2 ⊢ (∃*𝑥⊤ ↔ ∃𝑤∀𝑥(⊤ → 𝑥 = 𝑤))
2		stdpc5v 1971	. . . 4 ⊢ (∀𝑥(⊤ → 𝑥 = 𝑤) → (⊤ → ∀𝑥 𝑥 = 𝑤))
3		tru 1574	. . . . . 6 ⊢ ⊤
4	3	pm2.24i 151	. . . . 5 ⊢ (¬ ⊤ → 𝑦 = 𝑧)
5		aeveq 2091	. . . . 5 ⊢ (∀𝑥 𝑥 = 𝑤 → 𝑦 = 𝑧)
6	4, 5	ja 188	. . . 4 ⊢ ((⊤ → ∀𝑥 𝑥 = 𝑤) → 𝑦 = 𝑧)
7	2, 6	syl 18	. . 3 ⊢ (∀𝑥(⊤ → 𝑥 = 𝑤) → 𝑦 = 𝑧)
8	7	exlimiv 1963	. 2 ⊢ (∃𝑤∀𝑥(⊤ → 𝑥 = 𝑤) → 𝑦 = 𝑧)
9	1, 8	sylbi 220	1 ⊢ (∃*𝑥⊤ → 𝑦 = 𝑧)

This proof depends on syntax axioms:   → wi 4  ∀wal 1568  ⊤wtru 1571  ∃wex 1812  ∃*wmo 2564

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

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-mo 2566

This theorem is used by:  wl-motae  38280