Theorem relbrcnvg 5161

Description: When R is a relation, the sethood assumptions on brcnv 4958 can be omitted. (Contributed by Mario Carneiro, 28-Apr-2015.)

Assertion

Ref	Expression
relbrcnvg	|- ( Rel R -> ( A `' R B <-> B R A ) )

Proof of Theorem relbrcnvg

Step	Hyp	Ref	Expression
1		relcnv 5160	. . . 4 |- Rel `' R
2		brrelex12 4808	. . . 4 |- ( ( Rel `' R /\ A `' R B ) -> ( A e. _V /\ B e. _V ) )
3	1, 2	mpan 428	. . 3 |- ( A `' R B -> ( A e. _V /\ B e. _V ) )
4	3	a1i 9	. 2 |- ( Rel R -> ( A `' R B -> ( A e. _V /\ B e. _V ) ) )
5		brrelex12 4808	. . . 4 |- ( ( Rel R /\ B R A ) -> ( B e. _V /\ A e. _V ) )
6	5	ancomd 267	. . 3 |- ( ( Rel R /\ B R A ) -> ( A e. _V /\ B e. _V ) )
7	6	ex 115	. 2 |- ( Rel R -> ( B R A -> ( A e. _V /\ B e. _V ) ) )
8		brcnvg 4956	. . 3 |- ( ( A e. _V /\ B e. _V ) -> ( A `' R B <-> B R A ) )
9	8	a1i 9	. 2 |- ( Rel R -> ( ( A e. _V /\ B e. _V ) -> ( A `' R B <-> B R A ) ) )
10	4, 7, 9	pm5.21ndd 717	1 |- ( Rel R -> ( A `' R B <-> B R A ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   e. wcel 2209   _Vcvv 2821   class class class wbr 4125   `'ccnv 4768   Rel wrel 4774

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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-br 4126  df-opab 4188  df-xp 4775  df-rel 4776  df-cnv 4777

This theorem is referenced by:  eliniseg2  5162  relbrcnv  5163