| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rnuni | Structured version Visualization version GIF version | ||
| Description: The range of a union. Part of Exercise 8 of [Enderton] p. 41. (Contributed by NM, 17-Mar-2004.) (Revised by Mario Carneiro, 29-May-2015.) |
| Ref | Expression |
|---|---|
| rnuni | ⊢ ran ∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 ran 𝑥 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uniiun 5028 | . . 3 ⊢ ∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 𝑥 | |
| 2 | 1 | rneqi 5932 | . 2 ⊢ ran ∪ 𝐴 = ran ∪ 𝑥 ∈ 𝐴 𝑥 |
| 3 | rniun 6150 | . 2 ⊢ ran ∪ 𝑥 ∈ 𝐴 𝑥 = ∪ 𝑥 ∈ 𝐴 ran 𝑥 | |
| 4 | 2, 3 | eqtri 2789 | 1 ⊢ ran ∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 ran 𝑥 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∪ cuni 4877 ∪ ciun 4961 ran crn 5667 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-11 2195 ax-ext 2738 ax-sep 5262 ax-pr 5409 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-cnv 5674 df-dm 5676 df-rn 5677 |
| This theorem is used by: ackbij2 10244 axdc3lem2 10453 unirnmap 45965 unirnmapsn 45971 |
| Copyright terms: Public domain | W3C validator |