Theorem cbvrmodavw 36609

Description: Change bound variable in the restricted at-most-one quantifier. Deduction form. (Contributed by GG, 14-Aug-2025.)

Hypothesis

Ref	Expression
cbvrmodavw.1	⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
cbvrmodavw	⊢ (𝜑 → (∃*𝑥 ∈ 𝐴 𝜓 ↔ ∃*𝑦 ∈ 𝐴 𝜒))

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

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

Proof of Theorem cbvrmodavw

Step	Hyp	Ref	Expression
1		eleq1w 2845	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
2	1	adantl 485	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
3		cbvrmodavw.1	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒))
4	2, 3	anbi12d 641	. . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → ((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑦 ∈ 𝐴 ∧ 𝜒)))
5	4	cbvmodavw 36607	. 2 ⊢ (𝜑 → (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜓) ↔ ∃*𝑦(𝑦 ∈ 𝐴 ∧ 𝜒)))
6		df-rmo 3367	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜓 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))
7		df-rmo 3367	. 2 ⊢ (∃*𝑦 ∈ 𝐴 𝜒 ↔ ∃*𝑦(𝑦 ∈ 𝐴 ∧ 𝜒))
8	5, 6, 7	3bitr4g 316	1 ⊢ (𝜑 → (∃*𝑥 ∈ 𝐴 𝜓 ↔ ∃*𝑦 ∈ 𝐴 𝜒))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   ∈ wcel 2142  ∃*wmo 2564  ∃*wrmo 3366

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144

This theorem depends on definitions:  df-bi 209  df-an 400  df-ex 1800  df-mo 2566  df-clel 2837  df-rmo 3367

This theorem is referenced by:  cbvdisjdavw  36625