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

Theorem dfrel4v 5188
Description: A relation can be expressed as the set of ordered pairs in it. (Contributed by Mario Carneiro, 16-Aug-2015.)
Assertion
Ref Expression
dfrel4v  |-  ( Rel 
R  <->  R  =  { <. x ,  y >.  |  x R y } )
Distinct variable group:    x, y, R

Proof of Theorem dfrel4v
StepHypRef Expression
1 dfrel2 5187 . 2  |-  ( Rel 
R  <->  `' `' R  =  R
)
2 eqcom 2233 . 2  |-  ( `' `' R  =  R  <->  R  =  `' `' R
)
3 cnvcnv3 5186 . . 3  |-  `' `' R  =  { <. x ,  y >.  |  x R y }
43eqeq2i 2242 . 2  |-  ( R  =  `' `' R  <->  R  =  { <. x ,  y >.  |  x R y } )
51, 2, 43bitri 206 1  |-  ( Rel 
R  <->  R  =  { <. x ,  y >.  |  x R y } )
Colors of variables: wff set class
Syntax hints:    <-> wb 105    = wceq 1397   class class class wbr 4088   {copab 4149   `'ccnv 4724   Rel wrel 4730
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-opab 4151  df-xp 4731  df-rel 4732  df-cnv 4733
This theorem is referenced by:  dffn5im  5691
  Copyright terms: Public domain W3C validator