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

Theorem opelcnvg 5262
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 4617 . . 3 (𝑥 = 𝐴 → (𝑦𝑅𝑥𝑦𝑅𝐴))
2 breq1 4616 . . 3 (𝑦 = 𝐵 → (𝑦𝑅𝐴𝐵𝑅𝐴))
3 df-cnv 5082 . . 3 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑦𝑅𝑥}
41, 2, 3brabg 4954 . 2 ((𝐴𝐶𝐵𝐷) → (𝐴𝑅𝐵𝐵𝑅𝐴))
5 df-br 4614 . 2 (𝐴𝑅𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑅)
6 df-br 4614 . 2 (𝐵𝑅𝐴 ↔ ⟨𝐵, 𝐴⟩ ∈ 𝑅)
74, 5, 63bitr3g 302 1 ((𝐴𝐶𝐵𝐷) → (⟨𝐴, 𝐵⟩ ∈ 𝑅 ↔ ⟨𝐵, 𝐴⟩ ∈ 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384  wcel 1987  cop 4154   class class class wbr 4613  ccnv 5073
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4741  ax-nul 4749  ax-pr 4867
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-rab 2916  df-v 3188  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-nul 3892  df-if 4059  df-sn 4149  df-pr 4151  df-op 4155  df-br 4614  df-opab 4674  df-cnv 5082
This theorem is referenced by:  brcnvg  5263  opelcnv  5264  elpredim  5651  fvimacnv  6288  brtpos  7306  xrlenlt  10047  brcolinear2  31804
  Copyright terms: Public domain W3C validator