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

Theorem 0iun 3971
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 3465 . . . 4  |-  -.  E. x  e.  (/)  y  e.  A
2 eliun 3917 . . . 4  |-  ( y  e.  U_ x  e.  (/)  A  <->  E. x  e.  (/)  y  e.  A )
31, 2mtbir 672 . . 3  |-  -.  y  e.  U_ x  e.  (/)  A
4 noel 3451 . . 3  |-  -.  y  e.  (/)
53, 42false 702 . 2  |-  ( y  e.  U_ x  e.  (/)  A  <->  y  e.  (/) )
65eqriv 2190 1  |-  U_ x  e.  (/)  A  =  (/)
Colors of variables: wff set class
Syntax hints:    = wceq 1364    e. wcel 2164   E.wrex 2473   (/)c0 3447   U_ciun 3913
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-dif 3156  df-nul 3448  df-iun 3915
This theorem is referenced by:  iununir  3997  rdg0  6442  iunfidisj  7007  fsum2d  11581  fsumiun  11623  fprod2d  11769  iuncld  14294
  Copyright terms: Public domain W3C validator