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

Theorem iunxprg 3969
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 3601 . . . 4  |-  { A ,  B }  =  ( { A }  u.  { B } )
2 iuneq1 3901 . . . 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 3968 . . 3  |-  U_ x  e.  ( { A }  u.  { B } ) C  =  ( U_ x  e.  { A } C  u.  U_ x  e.  { B } C
)
53, 4eqtri 2198 . 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 3964 . . . 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 3964 . . . 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 3292 . 2  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( U_ x  e. 
{ A } C  u.  U_ x  e.  { B } C )  =  ( D  u.  E
) )
135, 12eqtrid 2222 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 1353    e. wcel 2148    u. cun 3129   {csn 3594   {cpr 3595   U_ciun 3888
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-sbc 2965  df-un 3135  df-in 3137  df-ss 3144  df-sn 3600  df-pr 3601  df-iun 3890
This theorem is referenced by:  unct  12445
  Copyright terms: Public domain W3C validator