Theorem dfrel4 6157

Description: A relation can be expressed as the set of ordered pairs in it. An analogue of dffn5 6900 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 6156	. 2 ⊢ (Rel 𝑅 ↔ 𝑅 = {⟨𝑎, 𝑏⟩ ∣ 𝑎𝑅𝑏})
2		nfcv 2899	. . . . 5 ⊢ Ⅎ𝑥𝑎
3		dfrel4.1	. . . . 5 ⊢ Ⅎ𝑥𝑅
4		nfcv 2899	. . . . 5 ⊢ Ⅎ𝑥𝑏
5	2, 3, 4	nfbr 5147	. . . 4 ⊢ Ⅎ𝑥 𝑎𝑅𝑏
6		nfcv 2899	. . . . 5 ⊢ Ⅎ𝑦𝑎
7		dfrel4.2	. . . . 5 ⊢ Ⅎ𝑦𝑅
8		nfcv 2899	. . . . 5 ⊢ Ⅎ𝑦𝑏
9	6, 7, 8	nfbr 5147	. . . 4 ⊢ Ⅎ𝑦 𝑎𝑅𝑏
10		nfv 1916	. . . 4 ⊢ Ⅎ𝑎 𝑥𝑅𝑦
11		nfv 1916	. . . 4 ⊢ Ⅎ𝑏 𝑥𝑅𝑦
12		breq12 5105	. . . 4 ⊢ ((𝑎 = 𝑥 ∧ 𝑏 = 𝑦) → (𝑎𝑅𝑏 ↔ 𝑥𝑅𝑦))
13	5, 9, 10, 11, 12	cbvopab 5172	. . 3 ⊢ {⟨𝑎, 𝑏⟩ ∣ 𝑎𝑅𝑏} = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦}
14	13	eqeq2i 2750	. 2 ⊢ (𝑅 = {⟨𝑎, 𝑏⟩ ∣ 𝑎𝑅𝑏} ↔ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦})
15	1, 14	bitri 275	1 ⊢ (Rel 𝑅 ↔ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦})

Syntax hints:   ↔ wb 206   = wceq 1542  Ⅎwnfc 2884   class class class wbr 5100  {copab 5162  Rel wrel 5637

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-pr 5379

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-opab 5163  df-xp 5638  df-rel 5639  df-cnv 5640

This theorem is referenced by:  feqmptdf  6912