MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  iunss2 Structured version   Unicode version

Theorem iunss2 4370
Description: A subclass condition on the members of two indexed classes 
C ( x ) and  D ( y ) that implies a subclass relation on their indexed unions. Generalization of Proposition 8.6 of [TakeutiZaring] p. 59. Compare uniss2 4278. (Contributed by NM, 9-Dec-2004.)
Assertion
Ref Expression
iunss2  |-  ( A. x  e.  A  E. y  e.  B  C  C_  D  ->  U_ x  e.  A  C  C_  U_ y  e.  B  D )
Distinct variable groups:    x, y    x, B    y, C    x, D
Allowed substitution hints:    A( x, y)    B( y)    C( x)    D( y)

Proof of Theorem iunss2
StepHypRef Expression
1 ssiun 4367 . . 3  |-  ( E. y  e.  B  C  C_  D  ->  C  C_  U_ y  e.  B  D )
21ralimi 2857 . 2  |-  ( A. x  e.  A  E. y  e.  B  C  C_  D  ->  A. x  e.  A  C  C_  U_ y  e.  B  D )
3 iunss 4366 . 2  |-  ( U_ x  e.  A  C  C_ 
U_ y  e.  B  D 
<-> 
A. x  e.  A  C  C_  U_ y  e.  B  D )
42, 3sylibr 212 1  |-  ( A. x  e.  A  E. y  e.  B  C  C_  D  ->  U_ x  e.  A  C  C_  U_ y  e.  B  D )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4   A.wral 2814   E.wrex 2815    C_ wss 3476   U_ciun 4325
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ral 2819  df-rex 2820  df-v 3115  df-in 3483  df-ss 3490  df-iun 4327
This theorem is referenced by:  iunxdif2  4373  oaass  7207  odi  7225  omass  7226  oelim2  7241
  Copyright terms: Public domain W3C validator