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

Theorem opelcnvg 5211
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 4580 . . 3 (𝑥 = 𝐴 → (𝑦𝑅𝑥𝑦𝑅𝐴))
2 breq1 4579 . . 3 (𝑦 = 𝐵 → (𝑦𝑅𝐴𝐵𝑅𝐴))
3 df-cnv 5035 . . 3 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑦𝑅𝑥}
41, 2, 3brabg 4908 . 2 ((𝐴𝐶𝐵𝐷) → (𝐴𝑅𝐵𝐵𝑅𝐴))
5 df-br 4577 . 2 (𝐴𝑅𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑅)
6 df-br 4577 . 2 (𝐵𝑅𝐴 ↔ ⟨𝐵, 𝐴⟩ ∈ 𝑅)
74, 5, 63bitr3g 300 1 ((𝐴𝐶𝐵𝐷) → (⟨𝐴, 𝐵⟩ ∈ 𝑅 ↔ ⟨𝐵, 𝐴⟩ ∈ 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 194  wa 382  wcel 1976  cop 4129   class class class wbr 4576  ccnv 5026
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1712  ax-4 1727  ax-5 1826  ax-6 1874  ax-7 1921  ax-9 1985  ax-10 2005  ax-11 2020  ax-12 2032  ax-13 2232  ax-ext 2588  ax-sep 4702  ax-nul 4711  ax-pr 4827
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 1867  df-eu 2460  df-mo 2461  df-clab 2595  df-cleq 2601  df-clel 2604  df-nfc 2738  df-rab 2903  df-v 3173  df-dif 3541  df-un 3543  df-in 3545  df-ss 3552  df-nul 3873  df-if 4035  df-sn 4124  df-pr 4126  df-op 4130  df-br 4577  df-opab 4637  df-cnv 5035
This theorem is referenced by:  brcnvg  5212  opelcnv  5213  elpredim  5594  fvimacnv  6224  brtpos  7224  xrlenlt  9953  brcolinear2  31140
  Copyright terms: Public domain W3C validator