HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem brcnvg 3303
Description: The converse of a binary relation swaps arguments. Theorem 11 of [Suppes] p. 61.
Assertion
Ref Expression
brcnvg |- ((A e. C /\ B e. D) -> (A`'RB <-> BRA))

Proof of Theorem brcnvg
StepHypRef Expression
1 opelcnvg 3302 . 2 |- ((A e. C /\ B e. D) -> (<.A, B>. e. `'R <-> <.B, A>. e. R))
2 df-br 2625 . 2 |- (A`'RB <-> <.A, B>. e. `'R)
3 df-br 2625 . 2 |- (BRA <-> <.B, A>. e. R)
41, 2, 33bitr4g 557 1 |- ((A e. C /\ B e. D) -> (A`'RB <-> BRA))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223   e. wcel 960  <.cop 2415   class class class wbr 2624  `'ccnv 3175
This theorem is referenced by:  brcnv 3305  brelrng 3349  lbinfm 6050
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-sep 2708  ax-pow 2748  ax-pr 2785
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-br 2625  df-opab 2672  df-cnv 3192
Copyright terms: Public domain