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

Theorem brun 4027
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 3258 . 2  |-  ( <. A ,  B >.  e.  ( R  u.  S
)  <->  ( <. A ,  B >.  e.  R  \/  <. A ,  B >.  e.  S ) )
2 df-br 3977 . 2  |-  ( A ( R  u.  S
) B  <->  <. A ,  B >.  e.  ( R  u.  S ) )
3 df-br 3977 . . 3  |-  ( A R B  <->  <. A ,  B >.  e.  R )
4 df-br 3977 . . 3  |-  ( A S B  <->  <. A ,  B >.  e.  S )
53, 4orbi12i 754 . 2  |-  ( ( A R B  \/  A S B )  <->  ( <. A ,  B >.  e.  R  \/  <. A ,  B >.  e.  S ) )
61, 2, 53bitr4i 211 1  |-  ( A ( R  u.  S
) B  <->  ( A R B  \/  A S B ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 104    \/ wo 698    e. wcel 2135    u. cun 3109   <.cop 3573   class class class wbr 3976
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-ext 2146
This theorem depends on definitions:  df-bi 116  df-tru 1345  df-nf 1448  df-sb 1750  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-v 2723  df-un 3115  df-br 3977
This theorem is referenced by:  dmun  4805  qfto  4987  poleloe  4997  cnvun  5003  coundi  5099  coundir  5100  brdifun  6519  ltxrlt  7955  ltxr  9702
  Copyright terms: Public domain W3C validator