Theorem brun 4145

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

Step	Hyp	Ref	Expression
1		elun 3350	. 2 |- ( <. A , B >. e. ( R u. S ) <-> ( <. A , B >. e. R \/ <. A , B >. e. S ) )
2		df-br 4094	. 2 |- ( A ( R u. S ) B <-> <. A , B >. e. ( R u. S ) )
3		df-br 4094	. . 3 |- ( A R B <-> <. A , B >. e. R )
4		df-br 4094	. . 3 |- ( A S B <-> <. A , B >. e. S )
5	3, 4	orbi12i 772	. 2 |- ( ( A R B \/ A S B ) <-> ( <. A , B >. e. R \/ <. A , B >. e. S ) )
6	1, 2, 5	3bitr4i 212	1 |- ( A ( R u. S ) B <-> ( A R B \/ A S B ) )

Syntax hints:   <-> wb 105   \/ wo 716   e. wcel 2202   u. cun 3199   <.cop 3676   class class class wbr 4093

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-v 2805  df-un 3205  df-br 4094

This theorem is referenced by:  dmun  4944  qfto  5133  poleloe  5143  cnvun  5149  coundi  5245  coundir  5246  fununmo  5379  brdifun  6772  ltxrlt  8287  ltxr  10054