Theorem dfrel4 6188

Description: A relation can be expressed as the set of ordered pairs in it. An analogue of dffn5 6951 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 6187	. 2 ⊢ (Rel 𝑅 ↔ 𝑅 = {⟨𝑎, 𝑏⟩ ∣ 𝑎𝑅𝑏})
2		nfcv 2925	. . . . 5 ⊢ Ⅎ𝑥𝑎
3		dfrel4.1	. . . . 5 ⊢ Ⅎ𝑥𝑅
4		nfcv 2925	. . . . 5 ⊢ Ⅎ𝑥𝑏
5	2, 3, 4	nfbr 5154	. . . 4 ⊢ Ⅎ𝑥 𝑎𝑅𝑏
6		nfcv 2925	. . . . 5 ⊢ Ⅎ𝑦𝑎
7		dfrel4.2	. . . . 5 ⊢ Ⅎ𝑦𝑅
8		nfcv 2925	. . . . 5 ⊢ Ⅎ𝑦𝑏
9	6, 7, 8	nfbr 5154	. . . 4 ⊢ Ⅎ𝑦 𝑎𝑅𝑏
10		nfv 1948	. . . 4 ⊢ Ⅎ𝑎 𝑥𝑅𝑦
11		nfv 1948	. . . 4 ⊢ Ⅎ𝑏 𝑥𝑅𝑦
12		breq12 5110	. . . 4 ⊢ ((𝑎 = 𝑥 ∧ 𝑏 = 𝑦) → (𝑎𝑅𝑏 ↔ 𝑥𝑅𝑦))
13	5, 9, 10, 11, 12	cbvopab 5179	. . 3 ⊢ {⟨𝑎, 𝑏⟩ ∣ 𝑎𝑅𝑏} = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦}
14	13	eqeq2i 2776	. 2 ⊢ (𝑅 = {⟨𝑎, 𝑏⟩ ∣ 𝑎𝑅𝑏} ↔ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦})
15	1, 14	bitri 278	1 ⊢ (Rel 𝑅 ↔ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦})

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1569  Ⅎwnfc 2910   class class class wbr 5105  {copab 5169  Rel wrel 5659

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-pr 5394

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-br 5106  df-opab 5170  df-xp 5660  df-rel 5661  df-cnv 5662

This theorem is used by:  feqmptdf  6963