![]() |
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 3284 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦〈𝑦, 𝑧〉 ∈ 𝐵 ↔ ∃𝑦∃𝑥 ∈ 𝐴 〈𝑦, 𝑧〉 ∈ 𝐵) | |
2 | vex 3477 | . . . . . 6 ⊢ 𝑧 ∈ V | |
3 | 2 | elrn2 5884 | . . . . 5 ⊢ (𝑧 ∈ ran 𝐵 ↔ ∃𝑦〈𝑦, 𝑧〉 ∈ 𝐵) |
4 | 3 | rexbii 3093 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝑧 ∈ ran 𝐵 ↔ ∃𝑥 ∈ 𝐴 ∃𝑦〈𝑦, 𝑧〉 ∈ 𝐵) |
5 | eliun 4994 | . . . . 5 ⊢ (〈𝑦, 𝑧〉 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 〈𝑦, 𝑧〉 ∈ 𝐵) | |
6 | 5 | exbii 1850 | . . . 4 ⊢ (∃𝑦〈𝑦, 𝑧〉 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑦∃𝑥 ∈ 𝐴 〈𝑦, 𝑧〉 ∈ 𝐵) |
7 | 1, 4, 6 | 3bitr4ri 303 | . . 3 ⊢ (∃𝑦〈𝑦, 𝑧〉 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑧 ∈ ran 𝐵) |
8 | 2 | elrn2 5884 | . . 3 ⊢ (𝑧 ∈ ran ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑦〈𝑦, 𝑧〉 ∈ ∪ 𝑥 ∈ 𝐴 𝐵) |
9 | eliun 4994 | . . 3 ⊢ (𝑧 ∈ ∪ 𝑥 ∈ 𝐴 ran 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑧 ∈ ran 𝐵) | |
10 | 7, 8, 9 | 3bitr4i 302 | . 2 ⊢ (𝑧 ∈ ran ∪ 𝑥 ∈ 𝐴 𝐵 ↔ 𝑧 ∈ ∪ 𝑥 ∈ 𝐴 ran 𝐵) |
11 | 10 | eqriv 2728 | 1 ⊢ ran ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ 𝐴 ran 𝐵 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1541 ∃wex 1781 ∈ wcel 2106 ∃wrex 3069 〈cop 4628 ∪ ciun 4990 ran crn 5670 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-11 2154 ax-ext 2702 ax-sep 5292 ax-nul 5299 ax-pr 5420 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2709 df-cleq 2723 df-clel 2809 df-rex 3070 df-rab 3432 df-v 3475 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4319 df-if 4523 df-sn 4623 df-pr 4625 df-op 4629 df-iun 4992 df-br 5142 df-opab 5204 df-cnv 5677 df-dm 5679 df-rn 5680 |
This theorem is referenced by: rnuni 6137 fiun 7911 f1iun 7912 cnextf 23499 iunrelexp0 42222 |
Copyright terms: Public domain | W3C validator |