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

Theorem relopab 5769
Description: A class of ordered pairs is a relation. (Contributed by NM, 8-Mar-1995.) Remove disjoint variable conditions. (Revised by Alan Sare, 9-Jul-2013.) (Proof shortened by Mario Carneiro, 21-Dec-2013.)
Assertion
Ref Expression
relopab Rel {⟨𝑥, 𝑦⟩ ∣ 𝜑}

Proof of Theorem relopab
StepHypRef Expression
1 eqid 2735 . 2 {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑥, 𝑦⟩ ∣ 𝜑}
21relopabi 5767 1 Rel {⟨𝑥, 𝑦⟩ ∣ 𝜑}
Colors of variables: wff setvar class
Syntax hints:  {copab 5136  Rel wrel 5625
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-11 2163  ax-12 2184  ax-ext 2707
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2714  df-cleq 2727  df-clel 2810  df-rab 3388  df-v 3429  df-dif 3888  df-un 3890  df-ss 3902  df-nul 4264  df-if 4457  df-sn 4558  df-pr 4560  df-op 4564  df-opab 5137  df-xp 5626  df-rel 5627
This theorem is referenced by:  relmptopab  7606  pwfir  9216  bj-0nelopab  37361  relecxrn  38716  relcic  49508
  Copyright terms: Public domain W3C validator