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

Theorem ss2iun 3693
Description: Subclass theorem for indexed union. (Contributed by NM, 26-Nov-2003.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
Assertion
Ref Expression
ss2iun  |-  ( A. x  e.  A  B  C_  C  ->  U_ x  e.  A  B  C_  U_ x  e.  A  C )

Proof of Theorem ss2iun
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 ssel 2993 . . . . 5  |-  ( B 
C_  C  ->  (
y  e.  B  -> 
y  e.  C ) )
21ralimi 2426 . . . 4  |-  ( A. x  e.  A  B  C_  C  ->  A. x  e.  A  ( y  e.  B  ->  y  e.  C ) )
3 rexim 2455 . . . 4  |-  ( A. x  e.  A  (
y  e.  B  -> 
y  e.  C )  ->  ( E. x  e.  A  y  e.  B  ->  E. x  e.  A  y  e.  C )
)
42, 3syl 14 . . 3  |-  ( A. x  e.  A  B  C_  C  ->  ( E. x  e.  A  y  e.  B  ->  E. x  e.  A  y  e.  C ) )
5 eliun 3682 . . 3  |-  ( y  e.  U_ x  e.  A  B  <->  E. x  e.  A  y  e.  B )
6 eliun 3682 . . 3  |-  ( y  e.  U_ x  e.  A  C  <->  E. x  e.  A  y  e.  C )
74, 5, 63imtr4g 203 . 2  |-  ( A. x  e.  A  B  C_  C  ->  ( y  e.  U_ x  e.  A  B  ->  y  e.  U_ x  e.  A  C
) )
87ssrdv 3005 1  |-  ( A. x  e.  A  B  C_  C  ->  U_ x  e.  A  B  C_  U_ x  e.  A  C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 1433   A.wral 2348   E.wrex 2349    C_ wss 2973   U_ciun 3678
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-in 2979  df-ss 2986  df-iun 3680
This theorem is referenced by:  iuneq2  3694
  Copyright terms: Public domain W3C validator