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

Theorem iunxprg 4046
Description: A pair index picks out two instances of an indexed union's argument. (Contributed by Alexander van der Vekens, 2-Feb-2018.)
Hypotheses
Ref Expression
iunxprg.1  |-  ( x  =  A  ->  C  =  D )
iunxprg.2  |-  ( x  =  B  ->  C  =  E )
Assertion
Ref Expression
iunxprg  |-  ( ( A  e.  V  /\  B  e.  W )  ->  U_ x  e.  { A ,  B } C  =  ( D  u.  E ) )
Distinct variable groups:    x, A    x, B    x, D    x, E
Allowed substitution hints:    C( x)    V( x)    W( x)

Proof of Theorem iunxprg
StepHypRef Expression
1 df-pr 3673 . . . 4  |-  { A ,  B }  =  ( { A }  u.  { B } )
2 iuneq1 3978 . . . 4  |-  ( { A ,  B }  =  ( { A }  u.  { B } )  ->  U_ x  e.  { A ,  B } C  =  U_ x  e.  ( { A }  u.  { B } ) C )
31, 2ax-mp 5 . . 3  |-  U_ x  e.  { A ,  B } C  =  U_ x  e.  ( { A }  u.  { B } ) C
4 iunxun 4045 . . 3  |-  U_ x  e.  ( { A }  u.  { B } ) C  =  ( U_ x  e.  { A } C  u.  U_ x  e.  { B } C
)
53, 4eqtri 2250 . 2  |-  U_ x  e.  { A ,  B } C  =  ( U_ x  e.  { A } C  u.  U_ x  e.  { B } C
)
6 iunxprg.1 . . . . 5  |-  ( x  =  A  ->  C  =  D )
76iunxsng 4041 . . . 4  |-  ( A  e.  V  ->  U_ x  e.  { A } C  =  D )
87adantr 276 . . 3  |-  ( ( A  e.  V  /\  B  e.  W )  ->  U_ x  e.  { A } C  =  D )
9 iunxprg.2 . . . . 5  |-  ( x  =  B  ->  C  =  E )
109iunxsng 4041 . . . 4  |-  ( B  e.  W  ->  U_ x  e.  { B } C  =  E )
1110adantl 277 . . 3  |-  ( ( A  e.  V  /\  B  e.  W )  ->  U_ x  e.  { B } C  =  E )
128, 11uneq12d 3359 . 2  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( U_ x  e. 
{ A } C  u.  U_ x  e.  { B } C )  =  ( D  u.  E
) )
135, 12eqtrid 2274 1  |-  ( ( A  e.  V  /\  B  e.  W )  ->  U_ x  e.  { A ,  B } C  =  ( D  u.  E ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395    e. wcel 2200    u. cun 3195   {csn 3666   {cpr 3667   U_ciun 3965
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-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-sbc 3029  df-un 3201  df-in 3203  df-ss 3210  df-sn 3672  df-pr 3673  df-iun 3967
This theorem is referenced by:  unct  13013
  Copyright terms: Public domain W3C validator