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 4946 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}) | |
2 | dfiun2.1 | . . 3 ⊢ 𝐵 ∈ V | |
3 | 2 | a1i 11 | . 2 ⊢ (𝑥 ∈ 𝐴 → 𝐵 ∈ V) |
4 | 1, 3 | mprg 3149 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1528 ∈ wcel 2105 {cab 2796 ∃wrex 3136 Vcvv 3492 ∪ cuni 4830 ∪ ciun 4910 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ral 3140 df-rex 3141 df-v 3494 df-uni 4831 df-iun 4912 |
This theorem is referenced by: fniunfv 6997 funcnvuni 7625 fiun 7633 f1iun 7634 tfrlem8 8009 rdglim2a 8058 rankuni 9280 cardiun 9399 kmlem11 9574 cfslb2n 9678 enfin2i 9731 pwcfsdom 9993 rankcf 10187 tskuni 10193 discmp 21934 cmpsublem 21935 cmpsub 21936 |
Copyright terms: Public domain | W3C validator |