| 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 5946 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) | |
| 2 | dfiun3.1 | . . 3 ⊢ 𝐵 ∈ V | |
| 3 | 2 | a1i 11 | . 2 ⊢ (𝑥 ∈ 𝐴 → 𝐵 ∈ V) |
| 4 | 1, 3 | mprg 3084 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1562 ∈ wcel 2144 Vcvv 3456 ∪ cuni 4867 ∪ ciun 4951 ↦ cmpt 5183 ran crn 5650 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-sep 5248 ax-pr 5392 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ral 3079 df-rex 3089 df-rab 3417 df-v 3458 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-cnv 5657 df-dm 5659 df-rn 5660 |
| This theorem is referenced by: tgrest 23221 comppfsc 23594 sigapildsys 34461 ldgenpisyslem1 34462 dstfrvunirn 34774 ctbssinf 37905 mblfinlem2 38162 volsupnfl 38169 istotbnd3 38275 sstotbnd 38279 rp-tfslim 43935 fourierdlem80 46765 |
| Copyright terms: Public domain | W3C validator |