Theorem cbviotavw 6501

Description: Change bound variables in a description binder. Version of cbviotav 6503 with a disjoint variable condition, which requires fewer axioms . (Contributed by Andrew Salmon, 1-Aug-2011.) (Revised by GG, 30-Sep-2024.)

Hypothesis

Ref	Expression
cbviotavw.1	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

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

Distinct variable groups:   𝜑,𝑦   𝜓,𝑥   𝑥,𝑦

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

Proof of Theorem cbviotavw

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cbviotavw.1	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
2	1	cbvabv 2831	. . . . 5 ⊢ {𝑥 ∣ 𝜑} = {𝑦 ∣ 𝜓}
3	2	eqeq1i 2766	. . . 4 ⊢ ({𝑥 ∣ 𝜑} = {𝑧} ↔ {𝑦 ∣ 𝜓} = {𝑧})
4	3	abbii 2828	. . 3 ⊢ {𝑧 ∣ {𝑥 ∣ 𝜑} = {𝑧}} = {𝑧 ∣ {𝑦 ∣ 𝜓} = {𝑧}}
5	4	unieqi 4879	. 2 ⊢ ∪ {𝑧 ∣ {𝑥 ∣ 𝜑} = {𝑧}} = ∪ {𝑧 ∣ {𝑦 ∣ 𝜓} = {𝑧}}
6		df-iota 6493	. 2 ⊢ (℩𝑥𝜑) = ∪ {𝑧 ∣ {𝑥 ∣ 𝜑} = {𝑧}}
7		df-iota 6493	. 2 ⊢ (℩𝑦𝜓) = ∪ {𝑧 ∣ {𝑦 ∣ 𝜓} = {𝑧}}
8	5, 6, 7	3eqtr4i 2794	1 ⊢ (℩𝑥𝜑) = (℩𝑦𝜓)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570  {cab 2739  {csn 4584  ∪ cuni 4867  ℩cio 6491

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 2147  ax-9 2155  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-v 3453  df-ss 3916  df-uni 4868  df-iota 6493

This theorem is used by:  cbvriotavw  7385  oeeui  8604  nosupcbv  28052  noinfcbv  28067  cbvriotavw2  37005  ellimciota  46595  fourierdlem96  47181  fourierdlem97  47182  fourierdlem98  47183  fourierdlem99  47184  fourierdlem105  47190  fourierdlem106  47191  fourierdlem108  47193  fourierdlem110  47195  fourierdlem112  47197  fourierdlem113  47198  fourierdlem115  47200  funressndmafv2rn  48262