| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dmiun | Structured version Visualization version GIF version | ||
| Description: The domain of an indexed union. (Contributed by Mario Carneiro, 26-Apr-2016.) |
| Ref | Expression |
|---|---|
| dmiun | ⊢ dom ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ 𝐴 dom 𝐵 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rexcom4 3279 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑧〈𝑦, 𝑧〉 ∈ 𝐵 ↔ ∃𝑧∃𝑥 ∈ 𝐴 〈𝑦, 𝑧〉 ∈ 𝐵) | |
| 2 | vex 3448 | . . . . . 6 ⊢ 𝑦 ∈ V | |
| 3 | 2 | eldm2 5866 | . . . . 5 ⊢ (𝑦 ∈ dom 𝐵 ↔ ∃𝑧〈𝑦, 𝑧〉 ∈ 𝐵) |
| 4 | 3 | rexbii 3099 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ dom 𝐵 ↔ ∃𝑥 ∈ 𝐴 ∃𝑧〈𝑦, 𝑧〉 ∈ 𝐵) |
| 5 | eliun 4943 | . . . . 5 ⊢ (〈𝑦, 𝑧〉 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 〈𝑦, 𝑧〉 ∈ 𝐵) | |
| 6 | 5 | exbii 1858 | . . . 4 ⊢ (∃𝑧〈𝑦, 𝑧〉 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑧∃𝑥 ∈ 𝐴 〈𝑦, 𝑧〉 ∈ 𝐵) |
| 7 | 1, 4, 6 | 3bitr4ri 306 | . . 3 ⊢ (∃𝑧〈𝑦, 𝑧〉 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ dom 𝐵) |
| 8 | 2 | eldm2 5866 | . . 3 ⊢ (𝑦 ∈ dom ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑧〈𝑦, 𝑧〉 ∈ ∪ 𝑥 ∈ 𝐴 𝐵) |
| 9 | eliun 4943 | . . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 dom 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ dom 𝐵) | |
| 10 | 7, 8, 9 | 3bitr4i 305 | . 2 ⊢ (𝑦 ∈ dom ∪ 𝑥 ∈ 𝐴 𝐵 ↔ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 dom 𝐵) |
| 11 | 10 | eqriv 2749 | 1 ⊢ dom ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ 𝐴 dom 𝐵 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1550 ∃wex 1789 ∈ wcel 2132 ∃wrex 3076 〈cop 4578 ∪ ciun 4939 dom cdm 5636 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-11 2181 ax-ext 2724 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-sb 2081 df-clab 2731 df-cleq 2744 df-clel 2827 df-rex 3077 df-rab 3405 df-v 3446 df-dif 3898 df-un 3900 df-ss 3912 df-nul 4277 df-if 4471 df-sn 4573 df-pr 4575 df-op 4579 df-iun 4941 df-br 5091 df-dm 5646 |
| This theorem is referenced by: dprd2d2 20058 dmdju 32788 gsumpart 33193 esum2d 34334 fmla 35669 iunrelexp0 44216 |
| Copyright terms: Public domain | W3C validator |