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 6828 for relations. (Contributed by Mario Carneiro, 16-Aug-2015.) |
Ref | Expression |
---|---|
dfrel4v | ⊢ (Rel 𝑅 ↔ 𝑅 = {〈𝑥, 𝑦〉 ∣ 𝑥𝑅𝑦}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfrel2 6092 | . 2 ⊢ (Rel 𝑅 ↔ ◡◡𝑅 = 𝑅) | |
2 | eqcom 2745 | . 2 ⊢ (◡◡𝑅 = 𝑅 ↔ 𝑅 = ◡◡𝑅) | |
3 | cnvcnv3 6091 | . . 3 ⊢ ◡◡𝑅 = {〈𝑥, 𝑦〉 ∣ 𝑥𝑅𝑦} | |
4 | 3 | eqeq2i 2751 | . 2 ⊢ (𝑅 = ◡◡𝑅 ↔ 𝑅 = {〈𝑥, 𝑦〉 ∣ 𝑥𝑅𝑦}) |
5 | 1, 2, 4 | 3bitri 297 | 1 ⊢ (Rel 𝑅 ↔ 𝑅 = {〈𝑥, 𝑦〉 ∣ 𝑥𝑅𝑦}) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 = wceq 1539 class class class wbr 5074 {copab 5136 ◡ccnv 5588 Rel wrel 5594 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-br 5075 df-opab 5137 df-xp 5595 df-rel 5596 df-cnv 5597 |
This theorem is referenced by: dfrel4 6094 dffn5 6828 fsplit 7957 fsplitOLD 7958 pwsle 17203 tgphaus 23268 fneer 34542 inxp2 36497 dfxrn2 36506 1cosscnvxrn 36593 dfafn5a 44652 sprsymrelfo 44949 |
Copyright terms: Public domain | W3C validator |