ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  0iun Unicode version

Theorem 0iun 4070
Description: An empty indexed union is empty. (Contributed by NM, 4-Dec-2004.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
Assertion
Ref Expression
0iun  |-  U_ x  e.  (/)  A  =  (/)

Proof of Theorem 0iun
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 rex0 3539 . . . 4  |-  -.  E. x  e.  (/)  y  e.  A
2 eliun 4016 . . . 4  |-  ( y  e.  U_ x  e.  (/)  A  <->  E. x  e.  (/)  y  e.  A )
31, 2mtbir 682 . . 3  |-  -.  y  e.  U_ x  e.  (/)  A
4 noel 3525 . . 3  |-  -.  y  e.  (/)
53, 42false 713 . 2  |-  ( y  e.  U_ x  e.  (/)  A  <->  y  e.  (/) )
65eqriv 2235 1  |-  U_ x  e.  (/)  A  =  (/)
Colors of variables:    wff set class
This proof depends on syntax axioms:    = wceq 1402    e. wcel 2209   E.wrex 2529   (/)c0 3520   U_ciun 4012
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-dif 3222  df-nul 3521  df-iun 4014
This theorem is used by:  iununir  4096  rdg0  6658  iunfidisj  7260  fsum2d  12202  fsumiun  12244  fprod2d  12390  iuncld  15216
  Copyright terms: Public domain W3C validator