Theorem cbvmovw 2627

Description: Change bound variable. Uses only Tarski's FOL axiom schemes. See cbvmo 2629 and cbvmow 2628 for versions with fewer disjoint variable conditions but requiring more axioms. (Contributed by NM, 9-Mar-1995.) (Revised by GG, 30-Sep-2024.)

Hypothesis

Ref	Expression
cbvmovw.1	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
cbvmovw	⊢ (∃*𝑥𝜑 ↔ ∃*𝑦𝜓)

Distinct variable groups:   𝑥,𝑦   𝜓,𝑥   𝜑,𝑦

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)

Proof of Theorem cbvmovw

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cbvmovw.1	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
2		equequ1 2057	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 = 𝑧 ↔ 𝑦 = 𝑧))
3	1, 2	imbi12d 347	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝜑 → 𝑥 = 𝑧) ↔ (𝜓 → 𝑦 = 𝑧)))
4	3	cbvalvw 2068	. . 3 ⊢ (∀𝑥(𝜑 → 𝑥 = 𝑧) ↔ ∀𝑦(𝜓 → 𝑦 = 𝑧))
5	4	exbii 1880	. 2 ⊢ (∃𝑧∀𝑥(𝜑 → 𝑥 = 𝑧) ↔ ∃𝑧∀𝑦(𝜓 → 𝑦 = 𝑧))
6		dfmo 2565	. 2 ⊢ (∃*𝑥𝜑 ↔ ∃𝑧∀𝑥(𝜑 → 𝑥 = 𝑧))
7		dfmo 2565	. 2 ⊢ (∃*𝑦𝜓 ↔ ∃𝑧∀𝑦(𝜓 → 𝑦 = 𝑧))
8	5, 6, 7	3bitr4i 306	1 ⊢ (∃*𝑥𝜑 ↔ ∃*𝑦𝜓)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1567  ∃wex 1811  ∃*wmo 2562

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-mo 2564

This theorem is used by:  cbveuvw  2630  cbvrmovw  3386  cbvrmovw2  37110