Theorem cbviindavw 36698

Description: Change bound variable in indexed intersections. Deduction form. (Contributed by GG, 14-Aug-2025.)

Hypothesis

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

Assertion

Ref	Expression
cbviindavw	⊢ (𝜑 → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑦 ∈ 𝐴 𝐶)

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

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

Proof of Theorem cbviindavw

Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cbviindavw.1	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → 𝐵 = 𝐶)
2	1	eleq2d 2855	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝑡 ∈ 𝐵 ↔ 𝑡 ∈ 𝐶))
3	2	cbvraldva 3251	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝑡 ∈ 𝐵 ↔ ∀𝑦 ∈ 𝐴 𝑡 ∈ 𝐶))
4	3	abbidv 2835	. 2 ⊢ (𝜑 → {𝑡 ∣ ∀𝑥 ∈ 𝐴 𝑡 ∈ 𝐵} = {𝑡 ∣ ∀𝑦 ∈ 𝐴 𝑡 ∈ 𝐶})
5		df-iin 4961	. 2 ⊢ ∩ 𝑥 ∈ 𝐴 𝐵 = {𝑡 ∣ ∀𝑥 ∈ 𝐴 𝑡 ∈ 𝐵}
6		df-iin 4961	. 2 ⊢ ∩ 𝑦 ∈ 𝐴 𝐶 = {𝑡 ∣ ∀𝑦 ∈ 𝐴 𝑡 ∈ 𝐶}
7	4, 5, 6	3eqtr4g 2829	1 ⊢ (𝜑 → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑦 ∈ 𝐴 𝐶)

Syntax hints:   → wi 4   ∧ wa 400   = wceq 1567   ∈ wcel 2149  {cab 2747  ∀wral 3085  ∩ ciin 4959

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741

This theorem depends on definitions:  df-bi 210  df-an 401  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-iin 4961

This theorem is referenced by: (None)