| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > iuneq1i | Structured version Visualization version GIF version | ||
| Description: Equality theorem for indexed union. (Contributed by Glauco Siliprandi, 3-Mar-2021.) Remove DV conditions. (Revised by GG, 1-Sep-2025.) |
| Ref | Expression |
|---|---|
| iuneq1i.1 | ⊢ 𝐴 = 𝐵 |
| Ref | Expression |
|---|---|
| iuneq1i | ⊢ ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐶 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iuneq1i.1 | . . . . . 6 ⊢ 𝐴 = 𝐵 | |
| 2 | 1 | eleq2i 2831 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) |
| 3 | 2 | anbi1i 630 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑡 ∈ 𝐶) ↔ (𝑥 ∈ 𝐵 ∧ 𝑡 ∈ 𝐶)) |
| 4 | 3 | rexbii2 3082 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 𝑡 ∈ 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝑡 ∈ 𝐶) |
| 5 | 4 | abbii 2806 | . 2 ⊢ {𝑡 ∣ ∃𝑥 ∈ 𝐴 𝑡 ∈ 𝐶} = {𝑡 ∣ ∃𝑥 ∈ 𝐵 𝑡 ∈ 𝐶} |
| 6 | df-iun 4923 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 𝐶 = {𝑡 ∣ ∃𝑥 ∈ 𝐴 𝑡 ∈ 𝐶} | |
| 7 | df-iun 4923 | . 2 ⊢ ∪ 𝑥 ∈ 𝐵 𝐶 = {𝑡 ∣ ∃𝑥 ∈ 𝐵 𝑡 ∈ 𝐶} | |
| 8 | 5, 6, 7 | 3eqtr4i 2772 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐶 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1547 ∈ wcel 2119 {cab 2717 ∃wrex 3063 ∪ ciun 4921 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-rex 3064 df-iun 4923 |
| This theorem is referenced by: ovolval4lem1 47092 |
| Copyright terms: Public domain | W3C validator |