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

Theorem dfrel4v 5121
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 5120 . 2  |-  ( Rel 
R  <->  `' `' R  =  R
)
2 eqcom 2198 . 2  |-  ( `' `' R  =  R  <->  R  =  `' `' R
)
3 cnvcnv3 5119 . . 3  |-  `' `' R  =  { <. x ,  y >.  |  x R y }
43eqeq2i 2207 . 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 1364   class class class wbr 4033   {copab 4093   `'ccnv 4662   Rel wrel 4668
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-br 4034  df-opab 4095  df-xp 4669  df-rel 4670  df-cnv 4671
This theorem is referenced by:  dffn5im  5606
  Copyright terms: Public domain W3C validator