![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > brun | GIF version |
Description: The union of two binary relations. (Contributed by NM, 21-Dec-2008.) |
Ref | Expression |
---|---|
brun | ⊢ (𝐴(𝑅 ∪ 𝑆)𝐵 ↔ (𝐴𝑅𝐵 ∨ 𝐴𝑆𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elun 3222 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ (𝑅 ∪ 𝑆) ↔ (〈𝐴, 𝐵〉 ∈ 𝑅 ∨ 〈𝐴, 𝐵〉 ∈ 𝑆)) | |
2 | df-br 3938 | . 2 ⊢ (𝐴(𝑅 ∪ 𝑆)𝐵 ↔ 〈𝐴, 𝐵〉 ∈ (𝑅 ∪ 𝑆)) | |
3 | df-br 3938 | . . 3 ⊢ (𝐴𝑅𝐵 ↔ 〈𝐴, 𝐵〉 ∈ 𝑅) | |
4 | df-br 3938 | . . 3 ⊢ (𝐴𝑆𝐵 ↔ 〈𝐴, 𝐵〉 ∈ 𝑆) | |
5 | 3, 4 | orbi12i 754 | . 2 ⊢ ((𝐴𝑅𝐵 ∨ 𝐴𝑆𝐵) ↔ (〈𝐴, 𝐵〉 ∈ 𝑅 ∨ 〈𝐴, 𝐵〉 ∈ 𝑆)) |
6 | 1, 2, 5 | 3bitr4i 211 | 1 ⊢ (𝐴(𝑅 ∪ 𝑆)𝐵 ↔ (𝐴𝑅𝐵 ∨ 𝐴𝑆𝐵)) |
Colors of variables: wff set class |
Syntax hints: ↔ wb 104 ∨ wo 698 ∈ wcel 1481 ∪ cun 3074 〈cop 3535 class class class wbr 3937 |
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 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 |
This theorem depends on definitions: df-bi 116 df-tru 1335 df-nf 1438 df-sb 1737 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-v 2691 df-un 3080 df-br 3938 |
This theorem is referenced by: dmun 4754 qfto 4936 poleloe 4946 cnvun 4952 coundi 5048 coundir 5049 brdifun 6464 ltxrlt 7854 ltxr 9592 |
Copyright terms: Public domain | W3C validator |