Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > brcnv | Unicode version |
Description: The converse of a binary relation swaps arguments. Theorem 11 of [Suppes] p. 61. (Contributed by NM, 13-Aug-1995.) |
Ref | Expression |
---|---|
opelcnv.1 | |
opelcnv.2 |
Ref | Expression |
---|---|
brcnv |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opelcnv.1 | . 2 | |
2 | opelcnv.2 | . 2 | |
3 | brcnvg 4720 | . 2 | |
4 | 1, 2, 3 | mp2an 422 | 1 |
Colors of variables: wff set class |
Syntax hints: wb 104 wcel 1480 cvv 2686 class class class wbr 3929 ccnv 4538 |
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 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-v 2688 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-br 3930 df-opab 3990 df-cnv 4547 |
This theorem is referenced by: cnvco 4724 dfrn2 4727 dfdm4 4731 cnvsym 4922 intasym 4923 asymref 4924 qfto 4928 dminss 4953 imainss 4954 dminxp 4983 cnvcnv3 4988 cnvpom 5081 cnvsom 5082 dffun2 5133 funcnvsn 5168 funcnv2 5183 funcnveq 5186 fun2cnv 5187 imadif 5203 f1ompt 5571 f1eqcocnv 5692 fliftcnv 5696 isocnv2 5713 ercnv 6450 ecid 6492 cnvinfex 6905 eqinfti 6907 infvalti 6909 infmoti 6915 dfinfre 8714 |
Copyright terms: Public domain | W3C validator |