Theorem dfrel4 6201

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

Hypotheses

Ref	Expression
dfrel4.1	⊢ Ⅎ𝑥𝑅
dfrel4.2	⊢ Ⅎ𝑦𝑅

Assertion

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

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝑅(𝑥, 𝑦)

Proof of Theorem dfrel4

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfrel4v 6200	. 2 ⊢ (Rel 𝑅 ↔ 𝑅 = {⟨𝑎, 𝑏⟩ ∣ 𝑎𝑅𝑏})
2		nfcv 2926	. . . . 5 ⊢ Ⅎ𝑥𝑎
3		dfrel4.1	. . . . 5 ⊢ Ⅎ𝑥𝑅
4		nfcv 2926	. . . . 5 ⊢ Ⅎ𝑥𝑏
5	2, 3, 4	nfbr 5158	. . . 4 ⊢ Ⅎ𝑥 𝑎𝑅𝑏
6		nfcv 2926	. . . . 5 ⊢ Ⅎ𝑦𝑎
7		dfrel4.2	. . . . 5 ⊢ Ⅎ𝑦𝑅
8		nfcv 2926	. . . . 5 ⊢ Ⅎ𝑦𝑏
9	6, 7, 8	nfbr 5158	. . . 4 ⊢ Ⅎ𝑦 𝑎𝑅𝑏
10		nfv 1949	. . . 4 ⊢ Ⅎ𝑎 𝑥𝑅𝑦
11		nfv 1949	. . . 4 ⊢ Ⅎ𝑏 𝑥𝑅𝑦
12		breq12 5113	. . . 4 ⊢ ((𝑎 = 𝑥 ∧ 𝑏 = 𝑦) → (𝑎𝑅𝑏 ↔ 𝑥𝑅𝑦))
13	5, 9, 10, 11, 12	cbvopab 5183	. . 3 ⊢ {⟨𝑎, 𝑏⟩ ∣ 𝑎𝑅𝑏} = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦}
14	13	eqeq2i 2776	. 2 ⊢ (𝑅 = {⟨𝑎, 𝑏⟩ ∣ 𝑎𝑅𝑏} ↔ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦})
15	1, 14	bitri 278	1 ⊢ (Rel 𝑅 ↔ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦})

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570  Ⅎwnfc 2911   class class class wbr 5108  {copab 5173  Rel wrel 5663

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-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398

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-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  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 4841  df-br 5109  df-opab 5174  df-xp 5664  df-rel 5665  df-cnv 5666

This theorem is used by:  feqmptdf  6986