Theorem cbvriotavw2 37005

Description: Change bound variable and domain in a restricted description binder, using implicit substitution. (Contributed by GG, 14-Aug-2025.)

Hypotheses

Ref	Expression
cbvriotavw2.1	⊢ (𝑥 = 𝑦 → 𝐴 = 𝐵)
cbvriotavw2.2	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

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

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

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

Proof of Theorem cbvriotavw2

Step	Hyp	Ref	Expression
1		id 23	. . . . 5 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦)
2		cbvriotavw2.1	. . . . 5 ⊢ (𝑥 = 𝑦 → 𝐴 = 𝐵)
3	1, 2	eleq12d 2855	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵))
4		cbvriotavw2.2	. . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
5	3, 4	anbi12d 644	. . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑦 ∈ 𝐵 ∧ 𝜓)))
6	5	cbviotavw 6501	. 2 ⊢ (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) = (℩𝑦(𝑦 ∈ 𝐵 ∧ 𝜓))
7		df-riota 7375	. 2 ⊢ (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
8		df-riota 7375	. 2 ⊢ (℩𝑦 ∈ 𝐵 𝜓) = (℩𝑦(𝑦 ∈ 𝐵 ∧ 𝜓))
9	6, 7, 8	3eqtr4i 2794	1 ⊢ (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑦 ∈ 𝐵 𝜓)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ℩cio 6491  ℩crio 7374

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  df-riota 7375

This theorem is used by: (None)