![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > iun0 | Structured version Visualization version Unicode 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 3919 |
. . . . 5
![]() ![]() ![]() ![]() ![]() | |
2 | 1 | a1i 11 |
. . . 4
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
3 | 2 | nrex 3000 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
4 | eliun 4524 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
5 | 3, 4 | mtbir 313 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
6 | 5 | nel0 3932 |
1
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Colors of variables: wff setvar class |
Syntax hints: ![]() ![]() ![]() ![]() ![]() ![]() |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-v 3202 df-dif 3577 df-nul 3916 df-iun 4522 |
This theorem is referenced by: iunxdif3 4606 iununi 4610 funiunfv 6506 om0r 7619 kmlem11 8982 ituniiun 9244 voliunlem1 23318 ofpreima2 29466 esum2dlem 30154 sigaclfu2 30184 measvunilem0 30276 measvuni 30277 cvmscld 31255 trpred0 31736 ovolval4lem1 40863 |
Copyright terms: Public domain | W3C validator |