| 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 3288 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑧〈𝑦, 𝑧〉 ∈ 𝐵 ↔ ∃𝑧∃𝑥 ∈ 𝐴 〈𝑦, 𝑧〉 ∈ 𝐵) | |
| 2 | vex 3484 | . . . . . 6 ⊢ 𝑦 ∈ V | |
| 3 | 2 | eldm2 5912 | . . . . 5 ⊢ (𝑦 ∈ dom 𝐵 ↔ ∃𝑧〈𝑦, 𝑧〉 ∈ 𝐵) |
| 4 | 3 | rexbii 3094 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ dom 𝐵 ↔ ∃𝑥 ∈ 𝐴 ∃𝑧〈𝑦, 𝑧〉 ∈ 𝐵) |
| 5 | eliun 4995 | . . . . 5 ⊢ (〈𝑦, 𝑧〉 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 〈𝑦, 𝑧〉 ∈ 𝐵) | |
| 6 | 5 | exbii 1848 | . . . 4 ⊢ (∃𝑧〈𝑦, 𝑧〉 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑧∃𝑥 ∈ 𝐴 〈𝑦, 𝑧〉 ∈ 𝐵) |
| 7 | 1, 4, 6 | 3bitr4ri 304 | . . 3 ⊢ (∃𝑧〈𝑦, 𝑧〉 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ dom 𝐵) |
| 8 | 2 | eldm2 5912 | . . 3 ⊢ (𝑦 ∈ dom ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑧〈𝑦, 𝑧〉 ∈ ∪ 𝑥 ∈ 𝐴 𝐵) |
| 9 | eliun 4995 | . . 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 1540 ∃wex 1779 ∈ wcel 2108 ∃wrex 3070 〈cop 4632 ∪ ciun 4991 dom cdm 5685 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-11 2157 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2065 df-clab 2715 df-cleq 2729 df-clel 2816 df-rex 3071 df-rab 3437 df-v 3482 df-dif 3954 df-un 3956 df-ss 3968 df-nul 4334 df-if 4526 df-sn 4627 df-pr 4629 df-op 4633 df-iun 4993 df-br 5144 df-dm 5695 |
| This theorem is referenced by: dprd2d2 20064 dmdju 32657 gsumpart 33060 esum2d 34094 fmla 35386 iunrelexp0 43715 |
| Copyright terms: Public domain | W3C validator |