Theorem brun 5136

Description: The union of two binary relations. (Contributed by NM, 21-Dec-2008.)

Assertion

Ref	Expression
brun	⊢ (𝐴(𝑅 ∪ 𝑆)𝐵 ↔ (𝐴𝑅𝐵 ∨ 𝐴𝑆𝐵))

Proof of Theorem brun

Step	Hyp	Ref	Expression
1		elun 4093	. 2 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝑅 ∪ 𝑆) ↔ (⟨𝐴, 𝐵⟩ ∈ 𝑅 ∨ ⟨𝐴, 𝐵⟩ ∈ 𝑆))
2		df-br 5086	. 2 ⊢ (𝐴(𝑅 ∪ 𝑆)𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ (𝑅 ∪ 𝑆))
3		df-br 5086	. . 3 ⊢ (𝐴𝑅𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑅)
4		df-br 5086	. . 3 ⊢ (𝐴𝑆𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑆)
5	3, 4	orbi12i 915	. 2 ⊢ ((𝐴𝑅𝐵 ∨ 𝐴𝑆𝐵) ↔ (⟨𝐴, 𝐵⟩ ∈ 𝑅 ∨ ⟨𝐴, 𝐵⟩ ∈ 𝑆))
6	1, 2, 5	3bitr4i 303	1 ⊢ (𝐴(𝑅 ∪ 𝑆)𝐵 ↔ (𝐴𝑅𝐵 ∨ 𝐴𝑆𝐵))

Syntax hints:   ↔ wb 206   ∨ wo 848   ∈ wcel 2114   ∪ cun 3887  ⟨cop 4573   class class class wbr 5085

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-v 3431  df-un 3894  df-br 5086

This theorem is referenced by:  dmun  5865  qfto  6084  poleloe  6094  cnvun  6106  coundi  6211  coundir  6212  fununmo  6545  eqfunresadj  7315  brdifun  8674  fpwwe2lem12  10565  ltxrlt  11216  ltxr  13066  dfle2  13098  brprop  32770  satfbrsuc  35548  dfso2  35937  dfon3  36072  brcup  36119  dfrdg4  36133  ecun  38714  dfsucmap3  38784  dffrege99  44389