Theorem cbviota 6505

Description: Change bound variables in a description binder. Usage of this theorem is discouraged because it depends on ax-13 2406. Use the weaker cbviotaw 6503 when possible. (Contributed by Andrew Salmon, 1-Aug-2011.) (New usage is discouraged.)

Hypotheses

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

Assertion

Ref	Expression
cbviota	⊢ (℩𝑥𝜑) = (℩𝑦𝜓)

Proof of Theorem cbviota

Dummy variables 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1947	. . . . . 6 ⊢ Ⅎ𝑧(𝜑 ↔ 𝑥 = 𝑤)
2		nfs1v 2194	. . . . . . 7 ⊢ Ⅎ𝑥[𝑧 / 𝑥]𝜑
3		nfv 1947	. . . . . . 7 ⊢ Ⅎ𝑥 𝑧 = 𝑤
4	2, 3	nfbi 1936	. . . . . 6 ⊢ Ⅎ𝑥([𝑧 / 𝑥]𝜑 ↔ 𝑧 = 𝑤)
5		sbequ12 2289	. . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
6		equequ1 2058	. . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑥 = 𝑤 ↔ 𝑧 = 𝑤))
7	5, 6	bibi12d 348	. . . . . 6 ⊢ (𝑥 = 𝑧 → ((𝜑 ↔ 𝑥 = 𝑤) ↔ ([𝑧 / 𝑥]𝜑 ↔ 𝑧 = 𝑤)))
8	1, 4, 7	cbvalv1 2375	. . . . 5 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑤) ↔ ∀𝑧([𝑧 / 𝑥]𝜑 ↔ 𝑧 = 𝑤))
9		cbviota.2	. . . . . . . 8 ⊢ Ⅎ𝑦𝜑
10	9	nfsb 2557	. . . . . . 7 ⊢ Ⅎ𝑦[𝑧 / 𝑥]𝜑
11		nfv 1947	. . . . . . 7 ⊢ Ⅎ𝑦 𝑧 = 𝑤
12	10, 11	nfbi 1936	. . . . . 6 ⊢ Ⅎ𝑦([𝑧 / 𝑥]𝜑 ↔ 𝑧 = 𝑤)
13		nfv 1947	. . . . . 6 ⊢ Ⅎ𝑧(𝜓 ↔ 𝑦 = 𝑤)
14		sbequ 2120	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑))
15		cbviota.3	. . . . . . . . 9 ⊢ Ⅎ𝑥𝜓
16		cbviota.1	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
17	15, 16	sbie 2536	. . . . . . . 8 ⊢ ([𝑦 / 𝑥]𝜑 ↔ 𝜓)
18	14, 17	bitrdi 290	. . . . . . 7 ⊢ (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ 𝜓))
19		equequ1 2058	. . . . . . 7 ⊢ (𝑧 = 𝑦 → (𝑧 = 𝑤 ↔ 𝑦 = 𝑤))
20	18, 19	bibi12d 348	. . . . . 6 ⊢ (𝑧 = 𝑦 → (([𝑧 / 𝑥]𝜑 ↔ 𝑧 = 𝑤) ↔ (𝜓 ↔ 𝑦 = 𝑤)))
21	12, 13, 20	cbvalv1 2375	. . . . 5 ⊢ (∀𝑧([𝑧 / 𝑥]𝜑 ↔ 𝑧 = 𝑤) ↔ ∀𝑦(𝜓 ↔ 𝑦 = 𝑤))
22	8, 21	bitri 278	. . . 4 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑤) ↔ ∀𝑦(𝜓 ↔ 𝑦 = 𝑤))
23	22	abbii 2832	. . 3 ⊢ {𝑤 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑤)} = {𝑤 ∣ ∀𝑦(𝜓 ↔ 𝑦 = 𝑤)}
24	23	unieqi 4886	. 2 ⊢ ∪ {𝑤 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑤)} = ∪ {𝑤 ∣ ∀𝑦(𝜓 ↔ 𝑦 = 𝑤)}
25		dfiota2 6497	. 2 ⊢ (℩𝑥𝜑) = ∪ {𝑤 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑤)}
26		dfiota2 6497	. 2 ⊢ (℩𝑦𝜓) = ∪ {𝑤 ∣ ∀𝑦(𝜓 ↔ 𝑦 = 𝑤)}
27	24, 25, 26	3eqtr4i 2798	1 ⊢ (℩𝑥𝜑) = (℩𝑦𝜓)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568   = wceq 1570  Ⅎwnf 1816  [wsb 2099  {cab 2743  ∪ cuni 4874  ℩cio 6494

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-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-13 2406  ax-ext 2737

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-clab 2744  df-cleq 2757  df-clel 2840  df-v 3459  df-ss 3923  df-sn 4592  df-uni 4875  df-iota 6496

This theorem is used by:  cbviotav  6506  cbvriota  7389