| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfrel4v | Structured version Visualization version GIF version | ||
| Description: A relation can be expressed as the set of ordered pairs in it. An analogue of dffn5 6943 for relations. (Contributed by Mario Carneiro, 16-Aug-2015.) |
| Ref | Expression |
|---|---|
| dfrel4v | ⊢ (Rel 𝑅 ↔ 𝑅 = {〈𝑥, 𝑦〉 ∣ 𝑥𝑅𝑦}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfrel2 6180 | . 2 ⊢ (Rel 𝑅 ↔ ◡◡𝑅 = 𝑅) | |
| 2 | eqcom 2767 | . 2 ⊢ (◡◡𝑅 = 𝑅 ↔ 𝑅 = ◡◡𝑅) | |
| 3 | cnvcnv3 6179 | . . 3 ⊢ ◡◡𝑅 = {〈𝑥, 𝑦〉 ∣ 𝑥𝑅𝑦} | |
| 4 | 3 | eqeq2i 2773 | . 2 ⊢ (𝑅 = ◡◡𝑅 ↔ 𝑅 = {〈𝑥, 𝑦〉 ∣ 𝑥𝑅𝑦}) |
| 5 | 1, 2, 4 | 3bitri 300 | 1 ⊢ (Rel 𝑅 ↔ 𝑅 = {〈𝑥, 𝑦〉 ∣ 𝑥𝑅𝑦}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1569 class class class wbr 5102 {copab 5166 ◡ccnv 5649 Rel wrel 5655 |
| 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 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pr 5390 |
| 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-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-br 5103 df-opab 5167 df-xp 5656 df-rel 5657 df-cnv 5658 |
| This theorem is used by: dfrel4 6182 dffn5 6943 fsplit 8128 pwsle 17664 tgphaus 24436 fneer 37141 inxp2 39308 dfxrn2 39318 1cosscnvxrn 39498 dfafn5a 48230 sprsymrelfo 48579 |
| Copyright terms: Public domain | W3C validator |