| 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 6931 for relations. (Contributed by Mario Carneiro, 16-Aug-2015.) |
| Ref | Expression |
|---|---|
| dfrel4v | ⊢ (Rel 𝑅 ↔ 𝑅 = {〈𝑥, 𝑦〉 ∣ 𝑥𝑅𝑦}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfrel2 6176 | . 2 ⊢ (Rel 𝑅 ↔ ◡◡𝑅 = 𝑅) | |
| 2 | eqcom 2767 | . 2 ⊢ (◡◡𝑅 = 𝑅 ↔ 𝑅 = ◡◡𝑅) | |
| 3 | cnvcnv3 6175 | . . 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 1570 class class class wbr 5102 {copab 5166 ◡ccnv 5646 Rel wrel 5652 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 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 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-br 5103 df-opab 5167 df-xp 5653 df-rel 5654 df-cnv 5655 |
| This theorem is used by: dfrel4 6178 dffn5 6931 fsplit 8111 pwsle 17625 tgphaus 24397 fneer 37063 inxp2 39227 dfxrn2 39237 1cosscnvxrn 39417 dfafn5a 48152 sprsymrelfo 48501 |
| Copyright terms: Public domain | W3C validator |