Theorem cbveud 38263

Description: Deduction used to change bound variables in an existential uniqueness quantifier, using implicit substitution. (Contributed by ML, 27-Mar-2021.)

Hypotheses

Ref	Expression
cbveud.1	⊢ Ⅎ𝑥𝜑
cbveud.2	⊢ Ⅎ𝑦𝜑
cbveud.3	⊢ (𝜑 → Ⅎ𝑦𝜓)
cbveud.4	⊢ (𝜑 → Ⅎ𝑥𝜒)
cbveud.5	⊢ (𝜑 → (𝑥 = 𝑦 → (𝜓 ↔ 𝜒)))

Assertion

Ref	Expression
cbveud	⊢ (𝜑 → (∃!𝑥𝜓 ↔ ∃!𝑦𝜒))

Distinct variable group:   𝑥,𝑦

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

Proof of Theorem cbveud

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cbveud.1	. . . 4 ⊢ Ⅎ𝑥𝜑
2		cbveud.2	. . . 4 ⊢ Ⅎ𝑦𝜑
3		cbveud.3	. . . . 5 ⊢ (𝜑 → Ⅎ𝑦𝜓)
4		nfvd 1948	. . . . 5 ⊢ (𝜑 → Ⅎ𝑦 𝑥 = 𝑧)
5	3, 4	nfbid 1935	. . . 4 ⊢ (𝜑 → Ⅎ𝑦(𝜓 ↔ 𝑥 = 𝑧))
6		cbveud.4	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥𝜒)
7		nfvd 1948	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥 𝑦 = 𝑧)
8	6, 7	nfbid 1935	. . . 4 ⊢ (𝜑 → Ⅎ𝑥(𝜒 ↔ 𝑦 = 𝑧))
9		cbveud.5	. . . . 5 ⊢ (𝜑 → (𝑥 = 𝑦 → (𝜓 ↔ 𝜒)))
10		simpr 490	. . . . . . 7 ⊢ ((𝑥 = 𝑦 ∧ (𝜓 ↔ 𝜒)) → (𝜓 ↔ 𝜒))
11		equequ1 2058	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝑥 = 𝑧 ↔ 𝑦 = 𝑧))
12	11	adantr 486	. . . . . . 7 ⊢ ((𝑥 = 𝑦 ∧ (𝜓 ↔ 𝜒)) → (𝑥 = 𝑧 ↔ 𝑦 = 𝑧))
13	10, 12	bibi12d 348	. . . . . 6 ⊢ ((𝑥 = 𝑦 ∧ (𝜓 ↔ 𝜒)) → ((𝜓 ↔ 𝑥 = 𝑧) ↔ (𝜒 ↔ 𝑦 = 𝑧)))
14	13	ex 418	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝜓 ↔ 𝜒) → ((𝜓 ↔ 𝑥 = 𝑧) ↔ (𝜒 ↔ 𝑦 = 𝑧))))
15	9, 14	sylcom 31	. . . 4 ⊢ (𝜑 → (𝑥 = 𝑦 → ((𝜓 ↔ 𝑥 = 𝑧) ↔ (𝜒 ↔ 𝑦 = 𝑧))))
16	1, 2, 5, 8, 15	cbv2w 2367	. . 3 ⊢ (𝜑 → (∀𝑥(𝜓 ↔ 𝑥 = 𝑧) ↔ ∀𝑦(𝜒 ↔ 𝑦 = 𝑧)))
17	16	exbidv 1954	. 2 ⊢ (𝜑 → (∃𝑧∀𝑥(𝜓 ↔ 𝑥 = 𝑧) ↔ ∃𝑧∀𝑦(𝜒 ↔ 𝑦 = 𝑧)))
18		eu6 2600	. 2 ⊢ (∃!𝑥𝜓 ↔ ∃𝑧∀𝑥(𝜓 ↔ 𝑥 = 𝑧))
19		eu6 2600	. 2 ⊢ (∃!𝑦𝜒 ↔ ∃𝑧∀𝑦(𝜒 ↔ 𝑦 = 𝑧))
20	17, 18, 19	3bitr4g 317	1 ⊢ (𝜑 → (∃!𝑥𝜓 ↔ ∃!𝑦𝜒))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568  ∃wex 1812  Ⅎwnf 1816  ∃!weu 2594

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 2178  ax-11 2194  ax-12 2213

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1813  df-nf 1817  df-mo 2565  df-eu 2595

This theorem is used by:  cbvreud  38264