ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  relopab Unicode version

Theorem relopab 4731
Description: A class of ordered pairs is a relation. (Contributed by NM, 8-Mar-1995.) (Unnecessary distinct variable restrictions were removed by Alan Sare, 9-Jul-2013.) (Proof shortened by Mario Carneiro, 21-Dec-2013.)
Assertion
Ref Expression
relopab  |-  Rel  { <. x ,  y >.  |  ph }

Proof of Theorem relopab
StepHypRef Expression
1 eqid 2165 . 2  |-  { <. x ,  y >.  |  ph }  =  { <. x ,  y >.  |  ph }
21relopabi 4730 1  |-  Rel  { <. x ,  y >.  |  ph }
Colors of variables: wff set class
Syntax hints:   {copab 4042   Rel wrel 4609
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-opab 4044  df-xp 4610  df-rel 4611
This theorem is referenced by:  opabid2  4735  inopab  4736  difopab  4737  dfres2  4936  cnvopab  5005  funopab  5223  elopabi  6163  shftfn  10766  lmreltop  12833
  Copyright terms: Public domain W3C validator