Theorem cbviing 5044

Description: Change bound variables in an indexed intersection. Usage of this theorem is discouraged because it depends on ax-13 2375. See cbviin 5042 for a version with more disjoint variable conditions, but not requiring ax-13 2375. (Contributed by Jeff Hankins, 26-Aug-2009.) (Revised by Mario Carneiro, 14-Oct-2016.) (New usage is discouraged.)

Hypotheses

Ref	Expression
cbviung.1	⊢ Ⅎ𝑦𝐵
cbviung.2	⊢ Ⅎ𝑥𝐶
cbviung.3	⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶)

Assertion

Ref	Expression
cbviing	⊢ ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑦 ∈ 𝐴 𝐶

Distinct variable groups:   𝑦,𝐴   𝑥,𝐴

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

Proof of Theorem cbviing

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cbviung.1	. . . . 5 ⊢ Ⅎ𝑦𝐵
2	1	nfcri 2895	. . . 4 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐵
3		cbviung.2	. . . . 5 ⊢ Ⅎ𝑥𝐶
4	3	nfcri 2895	. . . 4 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐶
5		cbviung.3	. . . . 5 ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶)
6	5	eleq2d 2825	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑧 ∈ 𝐵 ↔ 𝑧 ∈ 𝐶))
7	2, 4, 6	cbvral 3360	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∀𝑦 ∈ 𝐴 𝑧 ∈ 𝐶)
8	7	abbii 2807	. 2 ⊢ {𝑧 ∣ ∀𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} = {𝑧 ∣ ∀𝑦 ∈ 𝐴 𝑧 ∈ 𝐶}
9		df-iin 4999	. 2 ⊢ ∩ 𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ ∀𝑥 ∈ 𝐴 𝑧 ∈ 𝐵}
10		df-iin 4999	. 2 ⊢ ∩ 𝑦 ∈ 𝐴 𝐶 = {𝑧 ∣ ∀𝑦 ∈ 𝐴 𝑧 ∈ 𝐶}
11	8, 9, 10	3eqtr4i 2773	1 ⊢ ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑦 ∈ 𝐴 𝐶

Syntax hints:   → wi 4   = wceq 1537   ∈ wcel 2106  {cab 2712  Ⅎwnfc 2888  ∀wral 3059  ∩ ciin 4997

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-13 2375  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1540  df-ex 1777  df-nf 1781  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ral 3060  df-iin 4999

This theorem is referenced by:  cbviinvg  5048