Theorem opelcnvg 4916

Description: Ordered-pair membership in converse. (Contributed by NM, 13-May-1999.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)

Assertion

Ref	Expression
opelcnvg	|- ( ( A e. C /\ B e. D ) -> ( <. A , B >. e. `' R <-> <. B , A >. e. R ) )

Proof of Theorem opelcnvg

Dummy variables x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		breq2 4097	. . 3 |- ( x = A -> ( y R x <-> y R A ) )
2		breq1 4096	. . 3 |- ( y = B -> ( y R A <-> B R A ) )
3		df-cnv 4739	. . 3 |- `' R = { <. x , y >. | y R x }
4	1, 2, 3	brabg 4369	. 2 |- ( ( A e. C /\ B e. D ) -> ( A `' R B <-> B R A ) )
5		df-br 4094	. 2 |- ( A `' R B <-> <. A , B >. e. `' R )
6		df-br 4094	. 2 |- ( B R A <-> <. B , A >. e. R )
7	4, 5, 6	3bitr3g 222	1 |- ( ( A e. C /\ B e. D ) -> ( <. A , B >. e. `' R <-> <. B , A >. e. R ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   e. wcel 2202   <.cop 3676   class class class wbr 4093   `'ccnv 4730

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-br 4094  df-opab 4156  df-cnv 4739

This theorem is referenced by:  brcnvg  4917  opelcnv  4918  fvimacnv  5771  cnvf1olem  6398  brtposg  6463  xrlenlt  8303