Theorem cbviun 3966

Description: Rule used to change the bound variables in an indexed union, with the substitution specified implicitly by the hypothesis. (Contributed by NM, 26-Mar-2006.) (Revised by Andrew Salmon, 25-Jul-2011.)

Hypotheses

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

Assertion

Ref	Expression
cbviun	⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑦 ∈ 𝐴 𝐶

Distinct variable groups:   𝑦,𝐴   𝑥,𝐴

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

Proof of Theorem cbviun

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cbviun.1	. . . . 5 ⊢ Ⅎ𝑦𝐵
2	1	nfcri 2343	. . . 4 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐵
3		cbviun.2	. . . . 5 ⊢ Ⅎ𝑥𝐶
4	3	nfcri 2343	. . . 4 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐶
5		cbviun.3	. . . . 5 ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶)
6	5	eleq2d 2276	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑧 ∈ 𝐵 ↔ 𝑧 ∈ 𝐶))
7	2, 4, 6	cbvrex 2736	. . 3 ⊢ (∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∃𝑦 ∈ 𝐴 𝑧 ∈ 𝐶)
8	7	abbii 2322	. 2 ⊢ {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} = {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 ∈ 𝐶}
9		df-iun 3931	. 2 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵}
10		df-iun 3931	. 2 ⊢ ∪ 𝑦 ∈ 𝐴 𝐶 = {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 ∈ 𝐶}
11	8, 9, 10	3eqtr4i 2237	1 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑦 ∈ 𝐴 𝐶

Syntax hints:   → wi 4   = wceq 1373   ∈ wcel 2177  {cab 2192  Ⅎwnfc 2336  ∃wrex 2486  ∪ ciun 3929

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2188

This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-rex 2491  df-iun 3931

This theorem is referenced by:  cbviunv  3968  funiunfvdmf  5840  mpomptsx  6290  dmmpossx  6292  fmpox  6293  fsum2dlemstep  11789  fisumcom2  11793  fsumiun  11832  fprod2dlemstep  11977  fprodcom2fi  11981  ctiunctlemf  12853  ctiunctal  12856