Metamath Proof Explorer


Theorem cbviun

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) Add disjoint variable condition to avoid ax-13 . See cbviung for a less restrictive version requiring more axioms. (Revised by GG, 20-Jan-2024)

Ref Expression
Hypotheses cbviun.1 ⊢ Ⅎ _ y B
cbviun.2 ⊢ Ⅎ _ x C
cbviun.3 ⊢ x = y → B = C
Assertion cbviun ⊢ ⋃ x ∈ A B = ⋃ y ∈ A C

Proof

Step Hyp Ref Expression
1 cbviun.1 ⊢ Ⅎ _ y B
2 cbviun.2 ⊢ Ⅎ _ x C
3 cbviun.3 ⊢ x = y → B = C
4 1 nfcri ⊢ Ⅎ y z ∈ B
5 2 nfcri ⊢ Ⅎ x z ∈ C
6 3 eleq2d ⊢ x = y → z ∈ B ↔ z ∈ C
7 4 5 6 cbvrexw ⊢ ∃ x ∈ A z ∈ B ↔ ∃ y ∈ A z ∈ C
8 7 abbii ⊢ z | ∃ x ∈ A z ∈ B = z | ∃ y ∈ A z ∈ C
9 df-iun ⊢ ⋃ x ∈ A B = z | ∃ x ∈ A z ∈ B
10 df-iun ⊢ ⋃ y ∈ A C = z | ∃ y ∈ A z ∈ C
11 8 9 10 3eqtr4i ⊢ ⋃ x ∈ A B = ⋃ y ∈ A C