![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > dfiun3g | 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 |
---|---|
dfiun3g | ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfiun2g 4995 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}) | |
2 | eqid 2731 | . . . 4 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
3 | 2 | rnmpt 5915 | . . 3 ⊢ ran (𝑥 ∈ 𝐴 ↦ 𝐵) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} |
4 | 3 | unieqi 4883 | . 2 ⊢ ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} |
5 | 1, 4 | eqtr4di 2789 | 1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2106 {cab 2708 ∀wral 3060 ∃wrex 3069 ∪ cuni 4870 ∪ ciun 4959 ↦ cmpt 5193 ran crn 5639 |
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-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-sep 5261 ax-nul 5268 ax-pr 5389 |
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-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ral 3061 df-rex 3070 df-rab 3406 df-v 3448 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4288 df-if 4492 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4871 df-iun 4961 df-br 5111 df-opab 5173 df-mpt 5194 df-cnv 5646 df-dm 5648 df-rn 5649 |
This theorem is referenced by: dfiun3 5926 iunon 8290 onoviun 8294 gruiun 10744 tgiun 22366 acunirnmpt2f 31644 locfinreflem 32510 carsgclctunlem2 33008 pmeasadd 33014 saliunclf 44683 salexct3 44703 salgensscntex 44705 meadjiun 44827 omeiunle 44878 ovolval5lem2 45014 |
Copyright terms: Public domain | W3C validator |