![]() |
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 4247 | . . . . 5 ⊢ ¬ 𝑦 ∈ ∅ | |
2 | 1 | a1i 11 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → ¬ 𝑦 ∈ ∅) |
3 | 2 | nrex 3228 | . . 3 ⊢ ¬ ∃𝑥 ∈ 𝐴 𝑦 ∈ ∅ |
4 | eliun 4885 | . . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 ∅ ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ ∅) | |
5 | 3, 4 | mtbir 326 | . 2 ⊢ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 ∅ |
6 | 5 | nel0 4264 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 ∅ = ∅ |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 = wceq 1538 ∈ wcel 2111 ∃wrex 3107 ∅c0 4243 ∪ ciun 4881 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-v 3443 df-dif 3884 df-nul 4244 df-iun 4883 |
This theorem is referenced by: iunxdif3 4980 iununi 4984 funiunfv 6985 om0r 8147 kmlem11 9571 ituniiun 9833 dfrtrclrec2 14409 voliunlem1 24154 ofpreima2 30429 esum2dlem 31461 sigaclfu2 31490 measvunilem0 31582 measvuni 31583 cvmscld 32633 trpred0 33188 ovolval4lem1 43288 |
Copyright terms: Public domain | W3C validator |