| 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 4993 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}) | |
| 2 | dfiun2.1 | . . 3 ⊢ 𝐵 ∈ V | |
| 3 | 2 | a1i 11 | . 2 ⊢ (𝑥 ∈ 𝐴 → 𝐵 ∈ V) |
| 4 | 1, 3 | mprg 3086 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2147 {cab 2741 ∃wrex 3090 Vcvv 3454 ∪ cuni 4872 ∪ ciun 4956 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-11 2197 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-v 3456 df-uni 4873 df-iun 4958 |
| This theorem is used by: fniunfv 7282 funcnvuni 7978 fiun 7989 f1iun 7990 tfrlem8 8430 rdglim2a 8479 rankuni 9916 rankfilimbi 9939 cardiun 10102 kmlem11 10278 cfslb2n 10385 enfin2i 10438 pwcfsdom 10707 rankcf 10901 tskuni 10907 discmp 23771 cmpsublem 23772 cmpsub 23773 nmulprop 37154 nnoeomeqom 44636 |
| Copyright terms: Public domain | W3C validator |