MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  relbrcnv Structured version   Visualization version   GIF version

Theorem relbrcnv 5407
Description: When 𝑅 is a relation, the sethood assumptions on brcnv 5210 can be omitted. (Contributed by Mario Carneiro, 28-Apr-2015.)
Hypothesis
Ref Expression
relbrcnv.1 Rel 𝑅
Assertion
Ref Expression
relbrcnv (𝐴𝑅𝐵𝐵𝑅𝐴)

Proof of Theorem relbrcnv
StepHypRef Expression
1 relbrcnv.1 . 2 Rel 𝑅
2 relbrcnvg 5405 . 2 (Rel 𝑅 → (𝐴𝑅𝐵𝐵𝑅𝐴))
31, 2ax-mp 5 1 (𝐴𝑅𝐵𝐵𝑅𝐴)
Colors of variables: wff setvar class
Syntax hints:  wb 194   class class class wbr 4572  ccnv 5022  Rel wrel 5028
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1711  ax-4 1726  ax-5 1825  ax-6 1873  ax-7 1920  ax-9 1984  ax-10 2004  ax-11 2019  ax-12 2031  ax-13 2227  ax-ext 2584  ax-sep 4698  ax-nul 4707  ax-pr 4823
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-3an 1032  df-tru 1477  df-ex 1695  df-nf 1700  df-sb 1866  df-eu 2456  df-mo 2457  df-clab 2591  df-cleq 2597  df-clel 2600  df-nfc 2734  df-ral 2895  df-rex 2896  df-rab 2899  df-v 3169  df-dif 3537  df-un 3539  df-in 3541  df-ss 3548  df-nul 3869  df-if 4031  df-sn 4120  df-pr 4122  df-op 4126  df-br 4573  df-opab 4633  df-xp 5029  df-rel 5030  df-cnv 5031
This theorem is referenced by:  compssiso  9051  fneval  31318  brco2f1o  37148  brco3f1o  37149  neicvgnvor  37232
  Copyright terms: Public domain W3C validator