Theorem cbvmptdavw 37180

Description: Change bound variable in a maps-to function. Deduction form. (Contributed by GG, 14-Aug-2025.)

Hypothesis

Ref	Expression
cbvmptdavw.1	⊢ ((𝜑 ∧ 𝑥 = 𝑦) → 𝐵 = 𝐶)

Assertion

Ref	Expression
cbvmptdavw	⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑦 ∈ 𝐴 ↦ 𝐶))

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

Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑦)

Proof of Theorem cbvmptdavw

Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1w 2843	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
2	1	adantl 487	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
3		cbvmptdavw.1	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → 𝐵 = 𝐶)
4	3	eqeq2d 2771	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝑡 = 𝐵 ↔ 𝑡 = 𝐶))
5	2, 4	anbi12d 644	. . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → ((𝑥 ∈ 𝐴 ∧ 𝑡 = 𝐵) ↔ (𝑦 ∈ 𝐴 ∧ 𝑡 = 𝐶)))
6	5	cbvopab1davw 37177	. 2 ⊢ (𝜑 → {⟨𝑥, 𝑡⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑡 = 𝐵)} = {⟨𝑦, 𝑡⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝑡 = 𝐶)})
7		df-mpt 5186	. 2 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = {⟨𝑥, 𝑡⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑡 = 𝐵)}
8		df-mpt 5186	. 2 ⊢ (𝑦 ∈ 𝐴 ↦ 𝐶) = {⟨𝑦, 𝑡⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝑡 = 𝐶)}
9	6, 7, 8	3eqtr4g 2820	1 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑦 ∈ 𝐴 ↦ 𝐶))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {copab 5166   ↦ cmpt 5185

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-opab 5167  df-mpt 5186

This theorem is used by:  cbvproddavw  37193  cbvitgdavw  37194  cbvproddavw2  37209  cbvitgdavw2  37210