Theorem cbvrmovw2 36799

Description: Change bound variable and domain in the restricted at-most-one quantifier, using implicit substitution. (Contributed by GG, 14-Aug-2025.)

Hypotheses

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

Assertion

Ref	Expression
cbvrmovw2	⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑦 ∈ 𝐵 𝜓)

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

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

Proof of Theorem cbvrmovw2

Step	Hyp	Ref	Expression
1		eleq1w 2848	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
2		cbvrmovw2.1	. . . . . 6 ⊢ (𝑥 = 𝑦 → 𝐴 = 𝐵)
3	2	eleq2d 2851	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑦 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵))
4	1, 3	bitrd 282	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵))
5		cbvrmovw2.2	. . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
6	4, 5	anbi12d 644	. . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑦 ∈ 𝐵 ∧ 𝜓)))
7	6	cbvmovw 2632	. 2 ⊢ (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃*𝑦(𝑦 ∈ 𝐵 ∧ 𝜓))
8		df-rmo 3371	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
9		df-rmo 3371	. 2 ⊢ (∃*𝑦 ∈ 𝐵 𝜓 ↔ ∃*𝑦(𝑦 ∈ 𝐵 ∧ 𝜓))
10	7, 8, 9	3bitr4i 306	1 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑦 ∈ 𝐵 𝜓)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∃*wmo 2567  ∃*wrmo 3370

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-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-mo 2569  df-cleq 2757  df-clel 2840  df-rmo 3371

This theorem is used by:  cbvdisjvw2  36806