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

Theorem iunxdif2 4326
Description: Indexed union with a class difference as its index. (Contributed by NM, 10-Dec-2004.)
Hypothesis
Ref Expression
iunxdif2.1  |-  ( x  =  y  ->  C  =  D )
Assertion
Ref Expression
iunxdif2  |-  ( A. x  e.  A  E. y  e.  ( A  \  B ) C  C_  D  ->  U_ y  e.  ( A  \  B ) D  =  U_ x  e.  A  C )
Distinct variable groups:    x, y, A    x, B, y    y, C    x, D
Allowed substitution hints:    C( x)    D( y)

Proof of Theorem iunxdif2
StepHypRef Expression
1 iunss2 4323 . . 3  |-  ( A. x  e.  A  E. y  e.  ( A  \  B ) C  C_  D  ->  U_ x  e.  A  C  C_  U_ y  e.  ( A  \  B
) D )
2 difss 3560 . . . . 5  |-  ( A 
\  B )  C_  A
3 iunss1 4290 . . . . 5  |-  ( ( A  \  B ) 
C_  A  ->  U_ y  e.  ( A  \  B
) D  C_  U_ y  e.  A  D )
42, 3ax-mp 5 . . . 4  |-  U_ y  e.  ( A  \  B
) D  C_  U_ y  e.  A  D
5 iunxdif2.1 . . . . 5  |-  ( x  =  y  ->  C  =  D )
65cbviunv 4317 . . . 4  |-  U_ x  e.  A  C  =  U_ y  e.  A  D
74, 6sseqtr4i 3465 . . 3  |-  U_ y  e.  ( A  \  B
) D  C_  U_ x  e.  A  C
81, 7jctil 540 . 2  |-  ( A. x  e.  A  E. y  e.  ( A  \  B ) C  C_  D  ->  ( U_ y  e.  ( A  \  B
) D  C_  U_ x  e.  A  C  /\  U_ x  e.  A  C  C_ 
U_ y  e.  ( A  \  B ) D ) )
9 eqss 3447 . 2  |-  ( U_ y  e.  ( A  \  B ) D  = 
U_ x  e.  A  C 
<->  ( U_ y  e.  ( A  \  B
) D  C_  U_ x  e.  A  C  /\  U_ x  e.  A  C  C_ 
U_ y  e.  ( A  \  B ) D ) )
108, 9sylibr 216 1  |-  ( A. x  e.  A  E. y  e.  ( A  \  B ) C  C_  D  ->  U_ y  e.  ( A  \  B ) D  =  U_ x  e.  A  C )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 371    = wceq 1444   A.wral 2737   E.wrex 2738    \ cdif 3401    C_ wss 3404   U_ciun 4278
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1669  ax-4 1682  ax-5 1758  ax-6 1805  ax-7 1851  ax-10 1915  ax-11 1920  ax-12 1933  ax-13 2091  ax-ext 2431
This theorem depends on definitions:  df-bi 189  df-or 372  df-an 373  df-tru 1447  df-ex 1664  df-nf 1668  df-sb 1798  df-clab 2438  df-cleq 2444  df-clel 2447  df-nfc 2581  df-ral 2742  df-rex 2743  df-v 3047  df-dif 3407  df-in 3411  df-ss 3418  df-iun 4280
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator