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

Theorem relopab 5798
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 2763 . 2 {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑥, 𝑦⟩ ∣ 𝜑}
21relopabi 5796 1 Rel {⟨𝑥, 𝑦⟩ ∣ 𝜑}
Colors of variables: wff setvar class
Syntax hints:  {copab 5163  Rel wrel 5653
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1816  ax-4 1830  ax-5 1931  ax-6 1988  ax-7 2029  ax-8 2145  ax-9 2153  ax-11 2192  ax-12 2213  ax-ext 2735
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1564  df-fal 1574  df-ex 1801  df-sb 2092  df-clab 2742  df-cleq 2755  df-clel 2838  df-rab 3416  df-v 3457  df-dif 3908  df-un 3910  df-ss 3922  df-nul 4287  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-opab 5164  df-xp 5654  df-rel 5655
This theorem is referenced by:  relmptopab  7647  pwfir  9262  bj-0nelopab  37552  relecxrn  38907  relcic  49667
  Copyright terms: Public domain W3C validator