Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dfiun2 | Structured version Visualization version GIF version |
Description: Alternate definition of indexed union when 𝐵 is a set. Definition 15(a) of [Suppes] p. 44. (Contributed by NM, 27-Jun-1998.) (Revised by David Abernethy, 19-Jun-2012.) |
Ref | Expression |
---|---|
dfiun2.1 | ⊢ 𝐵 ∈ V |
Ref | Expression |
---|---|
dfiun2 | ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfiun2g 4488 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}) | |
2 | dfiun2.1 | . . 3 ⊢ 𝐵 ∈ V | |
3 | 2 | a1i 11 | . 2 ⊢ (𝑥 ∈ 𝐴 → 𝐵 ∈ V) |
4 | 1, 3 | mprg 2910 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1475 ∈ wcel 1977 {cab 2596 ∃wrex 2897 Vcvv 3173 ∪ cuni 4372 ∪ ciun 4455 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-v 3175 df-uni 4373 df-iun 4457 |
This theorem is referenced by: fniunfv 6409 funcnvuni 7012 fun11iun 7019 tfrlem8 7367 rdglim2a 7416 rankuni 8609 cardiun 8691 kmlem11 8865 cfslb2n 8973 enfin2i 9026 pwcfsdom 9284 rankcf 9478 tskuni 9484 discmp 21011 cmpsublem 21012 cmpsub 21013 |
Copyright terms: Public domain | W3C validator |