| 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 4285 | . . . . 5 ⊢ ¬ 𝑦 ∈ ∅ | |
| 2 | 1 | a1i 11 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → ¬ 𝑦 ∈ ∅) |
| 3 | 2 | nrex 3097 | . . 3 ⊢ ¬ ∃𝑥 ∈ 𝐴 𝑦 ∈ ∅ |
| 4 | eliun 4959 | . . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 ∅ ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ ∅) | |
| 5 | 3, 4 | mtbir 326 | . 2 ⊢ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 ∅ |
| 6 | 5 | nel0 4304 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 ∅ = ∅ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1572 ∈ wcel 2150 ∃wrex 3093 ∅c0 4280 ∪ ciun 4955 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1575 df-fal 1585 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-ral 3084 df-rex 3094 df-v 3455 df-dif 4049 df-nul 4281 df-iun 4957 |
| This theorem is used by: iunxdif3 5059 iununi 5063 funiunfv 7282 om0r 8584 kmlem11 10277 ituniiun 10538 dfrtrclrec2 15253 ssdifidllem 21693 voliunlem1 25928 ofpreima2 33360 esum2dlem 34836 sigaclfu2 34865 measvunilem0 34958 measvuni 34959 cvmscld 36247 ovolval4lem1 47992 |
| Copyright terms: Public domain | W3C validator |