Theorem cbvmo 2054

Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 9-Mar-1995.) (Revised by Andrew Salmon, 8-Jun-2011.)

Hypotheses

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

Assertion

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

Proof of Theorem cbvmo

Step	Hyp	Ref	Expression
1		cbvmo.1	. . . 4 ⊢ Ⅎ𝑦𝜑
2		cbvmo.2	. . . 4 ⊢ Ⅎ𝑥𝜓
3		cbvmo.3	. . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
4	1, 2, 3	cbvex 1744	. . 3 ⊢ (∃𝑥𝜑 ↔ ∃𝑦𝜓)
5	1, 2, 3	cbveu 2038	. . 3 ⊢ (∃!𝑥𝜑 ↔ ∃!𝑦𝜓)
6	4, 5	imbi12i 238	. 2 ⊢ ((∃𝑥𝜑 → ∃!𝑥𝜑) ↔ (∃𝑦𝜓 → ∃!𝑦𝜓))
7		df-mo 2018	. 2 ⊢ (∃*𝑥𝜑 ↔ (∃𝑥𝜑 → ∃!𝑥𝜑))
8		df-mo 2018	. 2 ⊢ (∃*𝑦𝜓 ↔ (∃𝑦𝜓 → ∃!𝑦𝜓))
9	6, 7, 8	3bitr4i 211	1 ⊢ (∃*𝑥𝜑 ↔ ∃*𝑦𝜓)

Syntax hints:   → wi 4   ↔ wb 104  Ⅎwnf 1448  ∃wex 1480  ∃!weu 2014  ∃*wmo 2015

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523

This theorem depends on definitions:  df-bi 116  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018

This theorem is referenced by:  dffun6f  5201