Theorem dfrel4v 6187

Description: A relation can be expressed as the set of ordered pairs in it. An analogue of dffn5 6940 for relations. (Contributed by Mario Carneiro, 16-Aug-2015.)

Assertion

Ref	Expression
dfrel4v	⊢ (Rel 𝑅 ↔ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦})

Distinct variable group:   𝑥,𝑦,𝑅

Proof of Theorem dfrel4v

Step	Hyp	Ref	Expression
1		dfrel2 6186	. 2 ⊢ (Rel 𝑅 ↔ ◡◡𝑅 = 𝑅)
2		eqcom 2769	. 2 ⊢ (◡◡𝑅 = 𝑅 ↔ 𝑅 = ◡◡𝑅)
3		cnvcnv3 6185	. . 3 ⊢ ◡◡𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦}
4	3	eqeq2i 2775	. 2 ⊢ (𝑅 = ◡◡𝑅 ↔ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦})
5	1, 2, 4	3bitri 300	1 ⊢ (Rel 𝑅 ↔ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦})

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570   class class class wbr 5107  {copab 5171  ^◡ccnv 5658  Rel wrel 5664

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 2734  ax-sep 5255  ax-pr 5402

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 2741  df-cleq 2754  df-clel 2837  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-xp 5665  df-rel 5666  df-cnv 5667

This theorem is used by:  dfrel4  6188  dffn5  6940  fsplit  8117  pwsle  17582  tgphaus  24344  fneer  36959  inxp2  39110  dfxrn2  39120  1cosscnvxrn  39300  dfafn5a  48035  sprsymrelfo  48384