Theorem relbrcnvg 5146

Description: When R is a relation, the sethood assumptions on brcnv 4943 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 5145	. . . 4 |- Rel `' R
2		brrelex12 4793	. . . 4 |- ( ( Rel `' R /\ A `' R B ) -> ( A e. _V /\ B e. _V ) )
3	1, 2	mpan 424	. . 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 4793	. . . 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 4941	. . 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 713	1 |- ( Rel R -> ( A `' R B <-> B R A ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   e. wcel 2205   _Vcvv 2815   class class class wbr 4114   `'ccnv 4753   Rel wrel 4759

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 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-br 4115  df-opab 4177  df-xp 4760  df-rel 4761  df-cnv 4762

This theorem is referenced by:  eliniseg2  5147  relbrcnv  5148