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

Theorem brun 4095
Description: The union of two binary relations. (Contributed by NM, 21-Dec-2008.)
Assertion
Ref Expression
brun  |-  ( A ( R  u.  S
) B  <->  ( A R B  \/  A S B ) )

Proof of Theorem brun
StepHypRef Expression
1 elun 3314 . 2  |-  ( <. A ,  B >.  e.  ( R  u.  S
)  <->  ( <. A ,  B >.  e.  R  \/  <. A ,  B >.  e.  S ) )
2 df-br 4045 . 2  |-  ( A ( R  u.  S
) B  <->  <. A ,  B >.  e.  ( R  u.  S ) )
3 df-br 4045 . . 3  |-  ( A R B  <->  <. A ,  B >.  e.  R )
4 df-br 4045 . . 3  |-  ( A S B  <->  <. A ,  B >.  e.  S )
53, 4orbi12i 766 . 2  |-  ( ( A R B  \/  A S B )  <->  ( <. A ,  B >.  e.  R  \/  <. A ,  B >.  e.  S ) )
61, 2, 53bitr4i 212 1  |-  ( A ( R  u.  S
) B  <->  ( A R B  \/  A S B ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 105    \/ wo 710    e. wcel 2176    u. cun 3164   <.cop 3636   class class class wbr 4044
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-ext 2187
This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1484  df-sb 1786  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-v 2774  df-un 3170  df-br 4045
This theorem is referenced by:  dmun  4885  qfto  5072  poleloe  5082  cnvun  5088  coundi  5184  coundir  5185  fununmo  5316  brdifun  6647  ltxrlt  8138  ltxr  9897
  Copyright terms: Public domain W3C validator