Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  relbrcnvg Structured version   Unicode version

Theorem relbrcnvg 5235
 Description: When is a relation, the sethood assumptions on brcnv 5047 can be omitted. (Contributed by Mario Carneiro, 28-Apr-2015.)
Assertion
Ref Expression
relbrcnvg

Proof of Theorem relbrcnvg
StepHypRef Expression
1 relcnv 5234 . . . 4
2 brrelex12 4907 . . . 4
31, 2mpan 652 . . 3
43a1i 11 . 2
5 brrelex12 4907 . . . 4
65ancomd 439 . . 3
76ex 424 . 2
8 brcnvg 5045 . . 3
98a1i 11 . 2
104, 7, 9pm5.21ndd 344 1
 Colors of variables: wff set class Syntax hints:   wi 4   wb 177   wa 359   wcel 1725  cvv 2948   class class class wbr 4204  ccnv 4869   wrel 4875 This theorem is referenced by:  eliniseg2  5236  relbrcnv  5237  isinv  13977 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416  ax-sep 4322  ax-nul 4330  ax-pr 4395 This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2284  df-mo 2285  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ne 2600  df-ral 2702  df-rex 2703  df-rab 2706  df-v 2950  df-dif 3315  df-un 3317  df-in 3319  df-ss 3326  df-nul 3621  df-if 3732  df-sn 3812  df-pr 3813  df-op 3815  df-br 4205  df-opab 4259  df-xp 4876  df-rel 4877  df-cnv 4878
 Copyright terms: Public domain W3C validator