Theorem dfrel4v 6187

Description: A relation can be expressed as the set of ordered pairs in it. An analogue of dffn5 6939 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 1569   class class class wbr 5108  {copab 5172  ^◡ccnv 5659  Rel wrel 5665

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5256  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-br 5109  df-opab 5173  df-xp 5666  df-rel 5667  df-cnv 5668

This theorem is used by:  dfrel4  6188  dffn5  6939  fsplit  8110  pwsle  17552  tgphaus  24285  fneer  36892  inxp2  39052  dfxrn2  39062  1cosscnvxrn  39242  dfafn5a  47925  sprsymrelfo  48274