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

Theorem 0iun 3870
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 3380 . . . 4  |-  -.  E. x  e.  (/)  y  e.  A
2 eliun 3817 . . . 4  |-  ( y  e.  U_ x  e.  (/)  A  <->  E. x  e.  (/)  y  e.  A )
31, 2mtbir 660 . . 3  |-  -.  y  e.  U_ x  e.  (/)  A
4 noel 3367 . . 3  |-  -.  y  e.  (/)
53, 42false 690 . 2  |-  ( y  e.  U_ x  e.  (/)  A  <->  y  e.  (/) )
65eqriv 2136 1  |-  U_ x  e.  (/)  A  =  (/)
Colors of variables: wff set class
Syntax hints:    = wceq 1331    e. wcel 1480   E.wrex 2417   (/)c0 3363   U_ciun 3813
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-dif 3073  df-nul 3364  df-iun 3815
This theorem is referenced by:  iununir  3896  rdg0  6284  iunfidisj  6834  fsum2d  11204  fsumiun  11246  iuncld  12284
  Copyright terms: Public domain W3C validator