Theorem cbvreu 3169

Description: Change the bound variable of a restricted uniqueness quantifier using implicit substitution. (Contributed by Mario Carneiro, 15-Oct-2016.)

Hypotheses

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

Assertion

Ref	Expression
cbvreu	⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑦 ∈ 𝐴 𝜓)

Distinct variable groups:   𝑥,𝐴   𝑦,𝐴

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

Proof of Theorem cbvreu

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1843	. . . 4 ⊢ Ⅎ𝑧(𝑥 ∈ 𝐴 ∧ 𝜑)
2	1	sb8eu 2503	. . 3 ⊢ (∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃!𝑧[𝑧 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑))
3		sban 2399	. . . 4 ⊢ ([𝑧 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑))
4	3	eubii 2492	. . 3 ⊢ (∃!𝑧[𝑧 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃!𝑧([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑))
5		clelsb3 2729	. . . . . 6 ⊢ ([𝑧 / 𝑥]𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴)
6	5	anbi1i 731	. . . . 5 ⊢ (([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑) ↔ (𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑))
7	6	eubii 2492	. . . 4 ⊢ (∃!𝑧([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑) ↔ ∃!𝑧(𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑))
8		nfv 1843	. . . . . 6 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐴
9		cbvral.1	. . . . . . 7 ⊢ Ⅎ𝑦𝜑
10	9	nfsb 2440	. . . . . 6 ⊢ Ⅎ𝑦[𝑧 / 𝑥]𝜑
11	8, 10	nfan 1828	. . . . 5 ⊢ Ⅎ𝑦(𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑)
12		nfv 1843	. . . . 5 ⊢ Ⅎ𝑧(𝑦 ∈ 𝐴 ∧ 𝜓)
13		eleq1 2689	. . . . . 6 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
14		sbequ 2376	. . . . . . 7 ⊢ (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑))
15		cbvral.2	. . . . . . . 8 ⊢ Ⅎ𝑥𝜓
16		cbvral.3	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
17	15, 16	sbie 2408	. . . . . . 7 ⊢ ([𝑦 / 𝑥]𝜑 ↔ 𝜓)
18	14, 17	syl6bb 276	. . . . . 6 ⊢ (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ 𝜓))
19	13, 18	anbi12d 747	. . . . 5 ⊢ (𝑧 = 𝑦 → ((𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑) ↔ (𝑦 ∈ 𝐴 ∧ 𝜓)))
20	11, 12, 19	cbveu 2505	. . . 4 ⊢ (∃!𝑧(𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑) ↔ ∃!𝑦(𝑦 ∈ 𝐴 ∧ 𝜓))
21	7, 20	bitri 264	. . 3 ⊢ (∃!𝑧([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑) ↔ ∃!𝑦(𝑦 ∈ 𝐴 ∧ 𝜓))
22	2, 4, 21	3bitri 286	. 2 ⊢ (∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃!𝑦(𝑦 ∈ 𝐴 ∧ 𝜓))
23		df-reu 2919	. 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
24		df-reu 2919	. 2 ⊢ (∃!𝑦 ∈ 𝐴 𝜓 ↔ ∃!𝑦(𝑦 ∈ 𝐴 ∧ 𝜓))
25	22, 23, 24	3bitr4i 292	1 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑦 ∈ 𝐴 𝜓)

Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384  Ⅎwnf 1708  [wsb 1880   ∈ wcel 1990  ∃!weu 2470  ∃!wreu 2914

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-cleq 2615  df-clel 2618  df-reu 2919

This theorem is referenced by:  cbvrmo  3170  cbvreuv  3173  reu8nf  3516  poimirlem25  33434