HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem iun0 2599
Description: An indexed union of the empty set is empty.
Assertion
Ref Expression
iun0 |- U_x e. A (/) = (/)

Proof of Theorem iun0
StepHypRef Expression
1 eliun 2565 . . 3 |- (y e. U_x e. A (/) <-> E.x e. A y e. (/))
2 noel 2280 . . . . . 6 |- -. y e. (/)
32a1i 8 . . . . 5 |- (x e. A -> -. y e. (/))
43nrex 1726 . . . 4 |- -. E.x e. A y e. (/)
54, 22false 718 . . 3 |- (E.x e. A y e. (/) <-> y e. (/))
61, 5bitr 173 . 2 |- (y e. U_x e. A (/) <-> y e. (/))
76eqriv 1472 1 |- U_x e. A (/) = (/)
Colors of variables: wff set class
Syntax hints:  -. wn 2   = wceq 954   e. wcel 956  E.wrex 1643  (/)c0 2276  U_ciun 2561
This theorem is referenced by:  om0r 4164  kmlem11 4755
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-12 966  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 979  df-sb 1170  df-clab 1462  df-cleq 1467  df-clel 1470  df-ral 1646  df-rex 1647  df-v 1808  df-dif 2045  df-nul 2277  df-iun 2563
Copyright terms: Public domain