Theorem cbvriota 7380

Description: Change bound variable in a restricted description binder. Usage of this theorem is discouraged because it depends on ax-13 2404. Use the weaker cbvriotaw 7376 when possible. (Contributed by NM, 18-Mar-2013.) (Revised by Mario Carneiro, 15-Oct-2016.) (New usage is discouraged.)

Hypotheses

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

Assertion

Ref	Expression
cbvriota	⊢ (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑦 ∈ 𝐴 𝜓)

Distinct variable groups:   𝑥,𝐴   𝑦,𝐴

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

Proof of Theorem cbvriota

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1w 2846	. . . . 5 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴))
2		sbequ12 2287	. . . . 5 ⊢ (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
3	1, 2	anbi12d 643	. . . 4 ⊢ (𝑥 = 𝑧 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑)))
4		nfv 1944	. . . 4 ⊢ Ⅎ𝑧(𝑥 ∈ 𝐴 ∧ 𝜑)
5		nfv 1944	. . . . 5 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐴
6		nfs1v 2191	. . . . 5 ⊢ Ⅎ𝑥[𝑧 / 𝑥]𝜑
7	5, 6	nfan 1929	. . . 4 ⊢ Ⅎ𝑥(𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑)
8	3, 4, 7	cbviota 6501	. . 3 ⊢ (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) = (℩𝑧(𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑))
9		eleq1w 2846	. . . . 5 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
10		sbequ 2117	. . . . . 6 ⊢ (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑))
11		cbvriota.2	. . . . . . 7 ⊢ Ⅎ𝑥𝜓
12		cbvriota.3	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
13	11, 12	sbie 2534	. . . . . 6 ⊢ ([𝑦 / 𝑥]𝜑 ↔ 𝜓)
14	10, 13	bitrdi 290	. . . . 5 ⊢ (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ 𝜓))
15	9, 14	anbi12d 643	. . . 4 ⊢ (𝑧 = 𝑦 → ((𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑) ↔ (𝑦 ∈ 𝐴 ∧ 𝜓)))
16		nfv 1944	. . . . 5 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐴
17		cbvriota.1	. . . . . 6 ⊢ Ⅎ𝑦𝜑
18	17	nfsb 2555	. . . . 5 ⊢ Ⅎ𝑦[𝑧 / 𝑥]𝜑
19	16, 18	nfan 1929	. . . 4 ⊢ Ⅎ𝑦(𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑)
20		nfv 1944	. . . 4 ⊢ Ⅎ𝑧(𝑦 ∈ 𝐴 ∧ 𝜓)
21	15, 19, 20	cbviota 6501	. . 3 ⊢ (℩𝑧(𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑)) = (℩𝑦(𝑦 ∈ 𝐴 ∧ 𝜓))
22	8, 21	eqtri 2786	. 2 ⊢ (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) = (℩𝑦(𝑦 ∈ 𝐴 ∧ 𝜓))
23		df-riota 7367	. 2 ⊢ (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
24		df-riota 7367	. 2 ⊢ (℩𝑦 ∈ 𝐴 𝜓) = (℩𝑦(𝑦 ∈ 𝐴 ∧ 𝜓))
25	22, 23, 24	3eqtr4i 2796	1 ⊢ (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑦 ∈ 𝐴 𝜓)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570  Ⅎwnf 1813  [wsb 2096   ∈ wcel 2143  ℩cio 6490  ℩crio 7366

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-13 2404  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1573  df-ex 1810  df-nf 1814  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-v 3457  df-ss 3922  df-sn 4590  df-uni 4873  df-iota 6492  df-riota 7367

This theorem is used by:  cbvriotav  7381