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

Theorem dfrel4v 6182
Description: A relation can be expressed as the set of ordered pairs in it. An analogue of dffn5 6943 for relations. (Contributed by Mario Carneiro, 16-Aug-2015.)
Assertion
Ref Expression
dfrel4v (Rel 𝑅 ↔ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦})
Distinct variable group:   𝑥,𝑦,𝑅

Proof of Theorem dfrel4v
StepHypRef Expression
1 dfrel2 6181 . 2 (Rel 𝑅 ↔ ◡◡𝑅 = 𝑅)
2 eqcom 2768 . 2 (◡◡𝑅 = 𝑅 ↔ 𝑅 = ◡◡𝑅)
3 cnvcnv3 6180 . . 3 ◡◡𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦}
43eqeq2i 2774 . 2 (𝑅 = ◡◡𝑅 ↔ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦})
51, 2, 43bitri 300 1 (Rel 𝑅 ↔ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570   class class class wbr 5103  {copab 5167  ◡ccnv 5650  Rel wrel 5656
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-cnv 5659
This theorem is used by:  dfrel4  6183  dffn5  6943  fsplit  8128  pwsle  17664  tgphaus  24436  fneer  37141  inxp2  39307  dfxrn2  39317  1cosscnvxrn  39497  dfafn5a  48229  sprsymrelfo  48578
  Copyright terms: Public domain W3C validator