| 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 3264 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑧〈𝑦, 𝑧〉 ∈ 𝐵 ↔ ∃𝑧∃𝑥 ∈ 𝐴 〈𝑦, 𝑧〉 ∈ 𝐵) | |
| 2 | vex 3445 | . . . . . 6 ⊢ 𝑦 ∈ V | |
| 3 | 2 | eldm2 5851 | . . . . 5 ⊢ (𝑦 ∈ dom 𝐵 ↔ ∃𝑧〈𝑦, 𝑧〉 ∈ 𝐵) |
| 4 | 3 | rexbii 3084 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ dom 𝐵 ↔ ∃𝑥 ∈ 𝐴 ∃𝑧〈𝑦, 𝑧〉 ∈ 𝐵) |
| 5 | eliun 4951 | . . . . 5 ⊢ (〈𝑦, 𝑧〉 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 〈𝑦, 𝑧〉 ∈ 𝐵) | |
| 6 | 5 | exbii 1850 | . . . 4 ⊢ (∃𝑧〈𝑦, 𝑧〉 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑧∃𝑥 ∈ 𝐴 〈𝑦, 𝑧〉 ∈ 𝐵) |
| 7 | 1, 4, 6 | 3bitr4ri 304 | . . 3 ⊢ (∃𝑧〈𝑦, 𝑧〉 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ dom 𝐵) |
| 8 | 2 | eldm2 5851 | . . 3 ⊢ (𝑦 ∈ dom ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑧〈𝑦, 𝑧〉 ∈ ∪ 𝑥 ∈ 𝐴 𝐵) |
| 9 | eliun 4951 | . . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 dom 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ dom 𝐵) | |
| 10 | 7, 8, 9 | 3bitr4i 303 | . 2 ⊢ (𝑦 ∈ dom ∪ 𝑥 ∈ 𝐴 𝐵 ↔ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 dom 𝐵) |
| 11 | 10 | eqriv 2734 | 1 ⊢ dom ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ 𝐴 dom 𝐵 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∃wex 1781 ∈ wcel 2114 ∃wrex 3061 〈cop 4587 ∪ ciun 4947 dom cdm 5625 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-11 2163 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rex 3062 df-rab 3401 df-v 3443 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4287 df-if 4481 df-sn 4582 df-pr 4584 df-op 4588 df-iun 4949 df-br 5100 df-dm 5635 |
| This theorem is referenced by: dprd2d2 19979 dmdju 32707 gsumpart 33127 esum2d 34231 fmla 35556 iunrelexp0 43979 |
| Copyright terms: Public domain | W3C validator |