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

Theorem opelcnvg 5052
 Description: Ordered-pair membership in converse. (Contributed by NM, 13-May-1999.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
Assertion
Ref Expression
opelcnvg

Proof of Theorem opelcnvg
Dummy variables are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq2 4216 . . 3
2 breq1 4215 . . 3
3 df-cnv 4886 . . 3
41, 2, 3brabg 4474 . 2
5 df-br 4213 . 2
6 df-br 4213 . 2
74, 5, 63bitr3g 279 1
 Colors of variables: wff set class Syntax hints:   wi 4   wb 177   wa 359   wcel 1725  cop 3817   class class class wbr 4212  ccnv 4877 This theorem is referenced by:  brcnvg  5053  opelcnv  5054  fvimacnv  5845  brtpos  6488  xrlenlt  9143  elpredim  25451  brcolinear2  25992 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 2417  ax-sep 4330  ax-nul 4338  ax-pr 4403 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 2285  df-mo 2286  df-clab 2423  df-cleq 2429  df-clel 2432  df-nfc 2561  df-ne 2601  df-rab 2714  df-v 2958  df-dif 3323  df-un 3325  df-in 3327  df-ss 3334  df-nul 3629  df-if 3740  df-sn 3820  df-pr 3821  df-op 3823  df-br 4213  df-opab 4267  df-cnv 4886
 Copyright terms: Public domain W3C validator