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

Theorem coundi 5132
Description: Class composition distributes over union. (Contributed by NM, 21-Dec-2008.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
Assertion
Ref Expression
coundi  |-  ( A  o.  ( B  u.  C ) )  =  ( ( A  o.  B )  u.  ( A  o.  C )
)

Proof of Theorem coundi
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 unopab 4084 . . 3  |-  ( {
<. x ,  y >.  |  E. z ( x B z  /\  z A y ) }  u.  { <. x ,  y >.  |  E. z ( x C z  /\  z A y ) } )  =  { <. x ,  y >.  |  ( E. z ( x B z  /\  z A y )  \/ 
E. z ( x C z  /\  z A y ) ) }
2 brun 4056 . . . . . . . 8  |-  ( x ( B  u.  C
) z  <->  ( x B z  \/  x C z ) )
32anbi1i 458 . . . . . . 7  |-  ( ( x ( B  u.  C ) z  /\  z A y )  <->  ( (
x B z  \/  x C z )  /\  z A y ) )
4 andir 819 . . . . . . 7  |-  ( ( ( x B z  \/  x C z )  /\  z A y )  <->  ( (
x B z  /\  z A y )  \/  ( x C z  /\  z A y ) ) )
53, 4bitri 184 . . . . . 6  |-  ( ( x ( B  u.  C ) z  /\  z A y )  <->  ( (
x B z  /\  z A y )  \/  ( x C z  /\  z A y ) ) )
65exbii 1605 . . . . 5  |-  ( E. z ( x ( B  u.  C ) z  /\  z A y )  <->  E. z
( ( x B z  /\  z A y )  \/  (
x C z  /\  z A y ) ) )
7 19.43 1628 . . . . 5  |-  ( E. z ( ( x B z  /\  z A y )  \/  ( x C z  /\  z A y ) )  <->  ( E. z ( x B z  /\  z A y )  \/  E. z ( x C z  /\  z A y ) ) )
86, 7bitr2i 185 . . . 4  |-  ( ( E. z ( x B z  /\  z A y )  \/ 
E. z ( x C z  /\  z A y ) )  <->  E. z ( x ( B  u.  C ) z  /\  z A y ) )
98opabbii 4072 . . 3  |-  { <. x ,  y >.  |  ( E. z ( x B z  /\  z A y )  \/ 
E. z ( x C z  /\  z A y ) ) }  =  { <. x ,  y >.  |  E. z ( x ( B  u.  C ) z  /\  z A y ) }
101, 9eqtri 2198 . 2  |-  ( {
<. x ,  y >.  |  E. z ( x B z  /\  z A y ) }  u.  { <. x ,  y >.  |  E. z ( x C z  /\  z A y ) } )  =  { <. x ,  y >.  |  E. z ( x ( B  u.  C ) z  /\  z A y ) }
11 df-co 4637 . . 3  |-  ( A  o.  B )  =  { <. x ,  y
>.  |  E. z
( x B z  /\  z A y ) }
12 df-co 4637 . . 3  |-  ( A  o.  C )  =  { <. x ,  y
>.  |  E. z
( x C z  /\  z A y ) }
1311, 12uneq12i 3289 . 2  |-  ( ( A  o.  B )  u.  ( A  o.  C ) )  =  ( { <. x ,  y >.  |  E. z ( x B z  /\  z A y ) }  u.  {
<. x ,  y >.  |  E. z ( x C z  /\  z A y ) } )
14 df-co 4637 . 2  |-  ( A  o.  ( B  u.  C ) )  =  { <. x ,  y
>.  |  E. z
( x ( B  u.  C ) z  /\  z A y ) }
1510, 13, 143eqtr4ri 2209 1  |-  ( A  o.  ( B  u.  C ) )  =  ( ( A  o.  B )  u.  ( A  o.  C )
)
Colors of variables: wff set class
Syntax hints:    /\ wa 104    \/ wo 708    = wceq 1353   E.wex 1492    u. cun 3129   class class class wbr 4005   {copab 4065    o. ccom 4632
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-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-v 2741  df-un 3135  df-br 4006  df-opab 4067  df-co 4637
This theorem is referenced by:  relcoi1  5162
  Copyright terms: Public domain W3C validator