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 4715 | . 2 | |
4 | 1, 2, 3 | mp2an 422 | 1 |
Colors of variables: wff set class |
Syntax hints: wb 104 wcel 1480 cvv 2681 class class class wbr 3924 ccnv 4533 |
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 2119 ax-sep 4041 ax-pow 4093 ax-pr 4126 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-eu 2000 df-mo 2001 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-v 2683 df-un 3070 df-in 3072 df-ss 3079 df-pw 3507 df-sn 3528 df-pr 3529 df-op 3531 df-br 3925 df-opab 3985 df-cnv 4542 |
This theorem is referenced by: cnvco 4719 dfrn2 4722 dfdm4 4726 cnvsym 4917 intasym 4918 asymref 4919 qfto 4923 dminss 4948 imainss 4949 dminxp 4978 cnvcnv3 4983 cnvpom 5076 cnvsom 5077 dffun2 5128 funcnvsn 5163 funcnv2 5178 funcnveq 5181 fun2cnv 5182 imadif 5198 f1ompt 5564 f1eqcocnv 5685 fliftcnv 5689 isocnv2 5706 ercnv 6443 ecid 6485 cnvinfex 6898 eqinfti 6900 infvalti 6902 infmoti 6908 dfinfre 8707 |
Copyright terms: Public domain | W3C validator |