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

Theorem iun0 2604
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 2570 . . 3 |- (y e. U_x e. A (/) <-> E.x e. A y e. (/))
2 noel 2284 . . . . . 6 |- -. y e. (/)
32a1i 8 . . . . 5 |- (x e. A -> -. y e. (/))
43nrex 1729 . . . 4 |- -. E.x e. A y e. (/)
54, 22false 719 . . 3 |- (E.x e. A y e. (/) <-> y e. (/))
61, 5bitr 173 . 2 |- (y e. U_x e. A (/) <-> y e. (/))
76eqriv 1474 1 |- U_x e. A (/) = (/)
Colors of variables: wff set class
Syntax hints:  -. wn 2   = wceq 956   e. wcel 958  E.wrex 1646  (/)c0 2280  U_ciun 2566
This theorem is referenced by:  om0r 4174  kmlem11 4775
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-ral 1649  df-rex 1650  df-v 1812  df-dif 2049  df-nul 2281  df-iun 2568
Copyright terms: Public domain