![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > brcnvg | GIF version |
Description: The converse of a binary relation swaps arguments. Theorem 11 of [Suppes] p. 61. (Contributed by NM, 10-Oct-2005.) |
Ref | Expression |
---|---|
brcnvg | ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴◡𝑅𝐵 ↔ 𝐵𝑅𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opelcnvg 4825 | . 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (〈𝐴, 𝐵〉 ∈ ◡𝑅 ↔ 〈𝐵, 𝐴〉 ∈ 𝑅)) | |
2 | df-br 4019 | . 2 ⊢ (𝐴◡𝑅𝐵 ↔ 〈𝐴, 𝐵〉 ∈ ◡𝑅) | |
3 | df-br 4019 | . 2 ⊢ (𝐵𝑅𝐴 ↔ 〈𝐵, 𝐴〉 ∈ 𝑅) | |
4 | 1, 2, 3 | 3bitr4g 223 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴◡𝑅𝐵 ↔ 𝐵𝑅𝐴)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2160 〈cop 3610 class class class wbr 4018 ◡ccnv 4643 |
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 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-14 2163 ax-ext 2171 ax-sep 4136 ax-pow 4192 ax-pr 4227 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-v 2754 df-un 3148 df-in 3150 df-ss 3157 df-pw 3592 df-sn 3613 df-pr 3614 df-op 3616 df-br 4019 df-opab 4080 df-cnv 4652 |
This theorem is referenced by: brcnv 4828 brelrng 4876 eliniseg 5016 relbrcnvg 5025 brcodir 5034 sefvex 5555 foeqcnvco 5812 isocnv2 5834 ersym 6572 brdifun 6587 ecidg 6626 cnvti 7049 eqinfti 7050 inflbti 7054 infglbti 7055 negiso 8943 xrnegiso 11305 pw1nct 15231 |
Copyright terms: Public domain | W3C validator |