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

Theorem iun0 4032
Description: An indexed union of the empty set is empty. (Contributed by NM, 26-Mar-2003.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
Assertion
Ref Expression
iun0  |-  U_ x  e.  A  (/)  =  (/)

Proof of Theorem iun0
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 noel 3500 . . . . . 6  |-  -.  y  e.  (/)
21a1i 9 . . . . 5  |-  ( x  e.  A  ->  -.  y  e.  (/) )
32nrex 2625 . . . 4  |-  -.  E. x  e.  A  y  e.  (/)
4 eliun 3979 . . . 4  |-  ( y  e.  U_ x  e.  A  (/)  <->  E. x  e.  A  y  e.  (/) )
53, 4mtbir 678 . . 3  |-  -.  y  e.  U_ x  e.  A  (/)
65, 12false 709 . 2  |-  ( y  e.  U_ x  e.  A  (/)  <->  y  e.  (/) )
76eqriv 2228 1  |-  U_ x  e.  A  (/)  =  (/)
Colors of variables: wff set class
Syntax hints:   -. wn 3    = wceq 1398    e. wcel 2202   E.wrex 2512   (/)c0 3496   U_ciun 3975
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-dif 3203  df-nul 3497  df-iun 3977
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator