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

Theorem brun 4703
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 3753 . 2  |-  ( <. A ,  B >.  e.  ( R  u.  S
)  <->  ( <. A ,  B >.  e.  R  \/  <. A ,  B >.  e.  S ) )
2 df-br 4654 . 2  |-  ( A ( R  u.  S
) B  <->  <. A ,  B >.  e.  ( R  u.  S ) )
3 df-br 4654 . . 3  |-  ( A R B  <->  <. A ,  B >.  e.  R )
4 df-br 4654 . . 3  |-  ( A S B  <->  <. A ,  B >.  e.  S )
53, 4orbi12i 543 . 2  |-  ( ( A R B  \/  A S B )  <->  ( <. A ,  B >.  e.  R  \/  <. A ,  B >.  e.  S ) )
61, 2, 53bitr4i 292 1  |-  ( A ( R  u.  S
) B  <->  ( A R B  \/  A S B ) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 196    \/ wo 383    e. wcel 1990    u. cun 3572   <.cop 4183   class class class wbr 4653
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-v 3202  df-un 3579  df-br 4654
This theorem is referenced by:  dmun  5331  qfto  5517  poleloe  5527  cnvun  5538  coundi  5636  coundir  5637  fununmo  5933  brdifun  7771  fpwwe2lem13  9464  ltxrlt  10108  ltxr  11949  dfle2  11980  dfso2  31644  eqfunresadj  31659  dfon3  31999  brcup  32046  dfrdg4  32058  dffrege99  38256
  Copyright terms: Public domain W3C validator