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

Theorem dfrel4v 6193
Description: A relation can be expressed as the set of ordered pairs in it. An analogue of dffn5 6963 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 6192 . 2 (Rel 𝑅 ↔ ◡◡𝑅 = 𝑅)
2 eqcom 2770 . 2 (◡◡𝑅 = 𝑅 ↔ 𝑅 = ◡◡𝑅)
3 cnvcnv3 6191 . . 3 ◡◡𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦}
43eqeq2i 2776 . 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 5106  {copab 5170  ◡ccnv 5654  Rel wrel 5660
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-pr 5395
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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  df-xp 5661  df-rel 5662  df-cnv 5663
This theorem is used by:  dfrel4  6194  dffn5  6963  fsplit  8152  pwsle  17690  tgphaus  24463  fneer  37318  inxp2  39498  dfxrn2  39508  1cosscnvxrn  39688  dfafn5a  48433  sprsymrelfo  48782
  Copyright terms: Public domain W3C validator