Theorem relbrcnvg 5048

Description: When R is a relation, the sethood assumptions on brcnv 4849 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 5047	. . . 4 |- Rel `' R
2		brrelex12 4701	. . . 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 4701	. . . 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 4847	. . 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 706	1 |- ( Rel R -> ( A `' R B <-> B R A ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   e. wcel 2167   _Vcvv 2763   class class class wbr 4033   `'ccnv 4662   Rel wrel 4668

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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-br 4034  df-opab 4095  df-xp 4669  df-rel 4670  df-cnv 4671

This theorem is referenced by:  eliniseg2  5049  relbrcnv  5050