| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iun0 | Structured version Visualization version GIF version | ||
| Description: An indexed union of the empty set is empty. (Contributed by NM, 26-Mar-2003.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) |
| Ref | Expression |
|---|---|
| iun0 | ⊢ ∪ 𝑥 ∈ 𝐴 ∅ = ∅ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | noel 4284 | . . . . 5 ⊢ ¬ 𝑦 ∈ ∅ | |
| 2 | 1 | a1i 11 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → ¬ 𝑦 ∈ ∅) |
| 3 | 2 | nrex 3091 | . . 3 ⊢ ¬ ∃𝑥 ∈ 𝐴 𝑦 ∈ ∅ |
| 4 | eliun 4955 | . . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 ∅ ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ ∅) | |
| 5 | 3, 4 | mtbir 326 | . 2 ⊢ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 ∅ |
| 6 | 5 | nel0 4302 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 ∅ = ∅ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1570 ∈ wcel 2145 ∃wrex 3087 ∅c0 4279 ∪ ciun 4951 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3078 df-rex 3088 df-v 3453 df-dif 3902 df-nul 4280 df-iun 4953 |
| This theorem is used by: iunxdif3 5055 iununi 5059 funiunfv 7252 om0r 8547 kmlem11 10239 ituniiun 10500 dfrtrclrec2 15211 ssdifidllem 21640 voliunlem1 25871 ofpreima2 33260 esum2dlem 34724 sigaclfu2 34753 measvunilem0 34846 measvuni 34847 cvmscld 36038 ovolval4lem1 47659 |
| Copyright terms: Public domain | W3C validator |