ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  brcnvg Unicode version

Theorem brcnvg 4785
Description: The converse of a binary relation swaps arguments. Theorem 11 of [Suppes] p. 61. (Contributed by NM, 10-Oct-2005.)
Assertion
Ref Expression
brcnvg  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( A `' R B 
<->  B R A ) )

Proof of Theorem brcnvg
StepHypRef Expression
1 opelcnvg 4784 . 2  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( <. A ,  B >.  e.  `' R  <->  <. B ,  A >.  e.  R ) )
2 df-br 3983 . 2  |-  ( A `' R B  <->  <. A ,  B >.  e.  `' R
)
3 df-br 3983 . 2  |-  ( B R A  <->  <. B ,  A >.  e.  R )
41, 2, 33bitr4g 222 1  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( A `' R B 
<->  B R A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    e. wcel 2136   <.cop 3579   class class class wbr 3982   `'ccnv 4603
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 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-v 2728  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-br 3983  df-opab 4044  df-cnv 4612
This theorem is referenced by:  brcnv  4787  brelrng  4835  eliniseg  4974  relbrcnvg  4983  brcodir  4991  sefvex  5507  foeqcnvco  5758  isocnv2  5780  ersym  6513  brdifun  6528  ecidg  6565  cnvti  6984  eqinfti  6985  inflbti  6989  infglbti  6990  negiso  8850  xrnegiso  11203  pw1nct  13893
  Copyright terms: Public domain W3C validator