Theorem relbrcnv 4991

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

Hypothesis

Ref	Expression
relbrcnv.1	⊢ Rel 𝑅

Assertion

Ref	Expression
relbrcnv	⊢ (𝐴◡𝑅𝐵 ↔ 𝐵𝑅𝐴)

Proof of Theorem relbrcnv

Step	Hyp	Ref	Expression
1		relbrcnv.1	. 2 ⊢ Rel 𝑅
2		relbrcnvg 4990	. 2 ⊢ (Rel 𝑅 → (𝐴◡𝑅𝐵 ↔ 𝐵𝑅𝐴))
3	1, 2	ax-mp 5	1 ⊢ (𝐴◡𝑅𝐵 ↔ 𝐵𝑅𝐴)

Syntax hints:   ↔ wb 104   class class class wbr 3989  ^◡ccnv 4610  Rel wrel 4616

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194

This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-br 3990  df-opab 4051  df-xp 4617  df-rel 4618  df-cnv 4619

This theorem is referenced by: (None)