Users' Mathboxes Mathbox for Gino Giotto < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cbviundavw Structured version   Visualization version   GIF version

Theorem cbviundavw 37051
Description: Change bound variable in indexed unions. Deduction form. (Contributed by GG, 14-Aug-2025.)
Hypothesis
Ref Expression
cbviundavw.1 ((𝜑 ∧ 𝑥 = 𝑦) → 𝐵 = 𝐶)
Assertion
Ref Expression
cbviundavw (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑦 ∈ 𝐴 𝐶)
Distinct variable groups:   𝜑,𝑥,𝑦   𝑥,𝐴,𝑦   𝑦,𝐵   𝑥,𝐶
Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑦)

Proof of Theorem cbviundavw
Dummy variable 𝑡 is distinct from all other variables.
StepHypRef Expression
1 cbviundavw.1 . . . . 5 ((𝜑 ∧ 𝑥 = 𝑦) → 𝐵 = 𝐶)
21eleq2d 2847 . . . 4 ((𝜑 ∧ 𝑥 = 𝑦) → (𝑡 ∈ 𝐵 ↔ 𝑡 ∈ 𝐶))
32cbvrexdva 3244 . . 3 (𝜑 → (∃𝑥 ∈ 𝐴 𝑡 ∈ 𝐵 ↔ ∃𝑦 ∈ 𝐴 𝑡 ∈ 𝐶))
43abbidv 2827 . 2 (𝜑 → {𝑡 ∣ ∃𝑥 ∈ 𝐴 𝑡 ∈ 𝐵} = {𝑡 ∣ ∃𝑦 ∈ 𝐴 𝑡 ∈ 𝐶})
5 df-iun 4953 . 2 ∪ 𝑥 ∈ 𝐴 𝐵 = {𝑡 ∣ ∃𝑥 ∈ 𝐴 𝑡 ∈ 𝐵}
6 df-iun 4953 . 2 ∪ 𝑦 ∈ 𝐴 𝐶 = {𝑡 ∣ ∃𝑦 ∈ 𝐴 𝑡 ∈ 𝐶}
74, 5, 63eqtr4g 2821 1 (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑦 ∈ 𝐴 𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2739  ∃wrex 3087  ∪ ciun 4951
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-iun 4953
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator