![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > rniun | Structured version Visualization version GIF version |
Description: The range of an indexed union. (Contributed by Mario Carneiro, 29-May-2015.) |
Ref | Expression |
---|---|
rniun | ⊢ ran ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ 𝐴 ran 𝐵 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rexcom4 3285 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦〈𝑦, 𝑧〉 ∈ 𝐵 ↔ ∃𝑦∃𝑥 ∈ 𝐴 〈𝑦, 𝑧〉 ∈ 𝐵) | |
2 | vex 3481 | . . . . . 6 ⊢ 𝑧 ∈ V | |
3 | 2 | elrn2 5905 | . . . . 5 ⊢ (𝑧 ∈ ran 𝐵 ↔ ∃𝑦〈𝑦, 𝑧〉 ∈ 𝐵) |
4 | 3 | rexbii 3091 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝑧 ∈ ran 𝐵 ↔ ∃𝑥 ∈ 𝐴 ∃𝑦〈𝑦, 𝑧〉 ∈ 𝐵) |
5 | eliun 4999 | . . . . 5 ⊢ (〈𝑦, 𝑧〉 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 〈𝑦, 𝑧〉 ∈ 𝐵) | |
6 | 5 | exbii 1844 | . . . 4 ⊢ (∃𝑦〈𝑦, 𝑧〉 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑦∃𝑥 ∈ 𝐴 〈𝑦, 𝑧〉 ∈ 𝐵) |
7 | 1, 4, 6 | 3bitr4ri 304 | . . 3 ⊢ (∃𝑦〈𝑦, 𝑧〉 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑧 ∈ ran 𝐵) |
8 | 2 | elrn2 5905 | . . 3 ⊢ (𝑧 ∈ ran ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑦〈𝑦, 𝑧〉 ∈ ∪ 𝑥 ∈ 𝐴 𝐵) |
9 | eliun 4999 | . . 3 ⊢ (𝑧 ∈ ∪ 𝑥 ∈ 𝐴 ran 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑧 ∈ ran 𝐵) | |
10 | 7, 8, 9 | 3bitr4i 303 | . 2 ⊢ (𝑧 ∈ ran ∪ 𝑥 ∈ 𝐴 𝐵 ↔ 𝑧 ∈ ∪ 𝑥 ∈ 𝐴 ran 𝐵) |
11 | 10 | eqriv 2731 | 1 ⊢ ran ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ 𝐴 ran 𝐵 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1536 ∃wex 1775 ∈ wcel 2105 ∃wrex 3067 〈cop 4636 ∪ ciun 4995 ran crn 5689 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-11 2154 ax-ext 2705 ax-sep 5301 ax-nul 5311 ax-pr 5437 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-sb 2062 df-clab 2712 df-cleq 2726 df-clel 2813 df-rex 3068 df-rab 3433 df-v 3479 df-dif 3965 df-un 3967 df-ss 3979 df-nul 4339 df-if 4531 df-sn 4631 df-pr 4633 df-op 4637 df-iun 4997 df-br 5148 df-opab 5210 df-cnv 5696 df-dm 5698 df-rn 5699 |
This theorem is referenced by: rnuni 6170 fiun 7965 f1iun 7966 cnextf 24089 iunrelexp0 43691 |
Copyright terms: Public domain | W3C validator |