| 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 2854 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) |
| 3 | 2 | anbi1i 633 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑡 ∈ 𝐶) ↔ (𝑥 ∈ 𝐵 ∧ 𝑡 ∈ 𝐶)) |
| 4 | 3 | rexbii2 3105 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 𝑡 ∈ 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝑡 ∈ 𝐶) |
| 5 | 4 | abbii 2829 | . 2 ⊢ {𝑡 ∣ ∃𝑥 ∈ 𝐴 𝑡 ∈ 𝐶} = {𝑡 ∣ ∃𝑥 ∈ 𝐵 𝑡 ∈ 𝐶} |
| 6 | df-iun 4951 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 𝐶 = {𝑡 ∣ ∃𝑥 ∈ 𝐴 𝑡 ∈ 𝐶} | |
| 7 | df-iun 4951 | . 2 ⊢ ∪ 𝑥 ∈ 𝐵 𝐶 = {𝑡 ∣ ∃𝑥 ∈ 𝐵 𝑡 ∈ 𝐶} | |
| 8 | 5, 6, 7 | 3eqtr4i 2795 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐶 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1560 ∈ wcel 2142 {cab 2740 ∃wrex 3086 ∪ ciun 4949 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-ext 2734 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-ex 1800 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-rex 3087 df-iun 4951 |
| This theorem is referenced by: ovolval4lem1 47220 |
| Copyright terms: Public domain | W3C validator |