Theorem cbveuALT 2638

Description: Alternative proof of cbveu 2637. Since df-eu 2599 combines two other quantifiers, one can base this theorem on their associated 'change bounded variable' kind of theorems as well. (Contributed by Wolf Lammen, 5-Jan-2023.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypotheses

Ref	Expression
cbveu.1	⊢ Ⅎ𝑦𝜑
cbveu.2	⊢ Ⅎ𝑥𝜓
cbveu.3	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
cbveuALT	⊢ (∃!𝑥𝜑 ↔ ∃!𝑦𝜓)

Proof of Theorem cbveuALT

Step	Hyp	Ref	Expression
1		cbveu.1	. . . 4 ⊢ Ⅎ𝑦𝜑
2		cbveu.2	. . . 4 ⊢ Ⅎ𝑥𝜓
3		cbveu.3	. . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
4	1, 2, 3	cbvex 2433	. . 3 ⊢ (∃𝑥𝜑 ↔ ∃𝑦𝜓)
5	1, 2, 3	cbvmo 2634	. . 3 ⊢ (∃*𝑥𝜑 ↔ ∃*𝑦𝜓)
6	4, 5	anbi12i 640	. 2 ⊢ ((∃𝑥𝜑 ∧ ∃*𝑥𝜑) ↔ (∃𝑦𝜓 ∧ ∃*𝑦𝜓))
7		df-eu 2599	. 2 ⊢ (∃!𝑥𝜑 ↔ (∃𝑥𝜑 ∧ ∃*𝑥𝜑))
8		df-eu 2599	. 2 ⊢ (∃!𝑦𝜓 ↔ (∃𝑦𝜓 ∧ ∃*𝑦𝜓))
9	6, 7, 8	3bitr4i 306	1 ⊢ (∃!𝑥𝜑 ↔ ∃!𝑦𝜓)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∃wex 1812  Ⅎwnf 1816  ∃*wmo 2567  ∃!weu 2598

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-10 2179  ax-11 2195  ax-12 2216  ax-13 2406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599

This theorem is used by: (None)