| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > relopab | Structured version Visualization version GIF version | ||
| Description: A class of ordered pairs is a relation. (Contributed by NM, 8-Mar-1995.) Remove disjoint variable conditions. (Revised by Alan Sare, 9-Jul-2013.) (Proof shortened by Mario Carneiro, 21-Dec-2013.) |
| Ref | Expression |
|---|---|
| relopab | ⊢ Rel {〈𝑥, 𝑦〉 ∣ 𝜑} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2763 | . 2 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {〈𝑥, 𝑦〉 ∣ 𝜑} | |
| 2 | 1 | relopabi 5805 | 1 ⊢ Rel {〈𝑥, 𝑦〉 ∣ 𝜑} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: {copab 5170 Rel wrel 5660 |
| 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-11 2196 ax-12 2215 ax-ext 2735 |
| 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 2101 df-clab 2742 df-cleq 2755 df-clel 2839 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-opab 5171 df-xp 5661 df-rel 5662 |
| This theorem is used by: relmptopab 7681 pwfir 9322 bj-0nelopab 38123 relecxrn 39482 relcic 50301 |
| Copyright terms: Public domain | W3C validator |