| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfiun3 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of indexed union when 𝐵 is a set. (Contributed by Mario Carneiro, 31-Aug-2015.) |
| Ref | Expression |
|---|---|
| dfiun3.1 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| dfiun3 | ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfiun3g 5912 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) | |
| 2 | dfiun3.1 | . . 3 ⊢ 𝐵 ∈ V | |
| 3 | 2 | a1i 11 | . 2 ⊢ (𝑥 ∈ 𝐴 → 𝐵 ∈ V) |
| 4 | 1, 3 | mprg 3055 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∈ wcel 2114 Vcvv 3427 ∪ cuni 4840 ∪ ciun 4923 ↦ cmpt 5155 ran crn 5621 |
| 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-10 2147 ax-11 2163 ax-12 2184 ax-ext 2707 ax-sep 5220 ax-pr 5364 |
| 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-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ral 3050 df-rex 3060 df-rab 3388 df-v 3429 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4264 df-if 4457 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-cnv 5628 df-dm 5630 df-rn 5631 |
| This theorem is referenced by: tgrest 23112 comppfsc 23485 sigapildsys 34294 ldgenpisyslem1 34295 dstfrvunirn 34607 ctbssinf 37710 mblfinlem2 37967 volsupnfl 37974 istotbnd3 38080 sstotbnd 38084 rp-tfslim 43769 fourierdlem80 46602 |
| Copyright terms: Public domain | W3C validator |