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 2738 | . 2 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {〈𝑥, 𝑦〉 ∣ 𝜑} | |
2 | 1 | relopabi 5667 | 1 ⊢ Rel {〈𝑥, 𝑦〉 ∣ 𝜑} |
Colors of variables: wff setvar class |
Syntax hints: {copab 5093 Rel wrel 5531 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1916 ax-6 1974 ax-7 2019 ax-8 2115 ax-9 2123 ax-11 2161 ax-12 2178 ax-ext 2710 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3an 1090 df-tru 1545 df-ex 1787 df-sb 2074 df-clab 2717 df-cleq 2730 df-clel 2811 df-v 3400 df-un 3849 df-in 3851 df-ss 3861 df-sn 4518 df-pr 4520 df-op 4524 df-opab 5094 df-xp 5532 df-rel 5533 |
This theorem is referenced by: relmptopab 7412 pwfir 8775 bj-0nelopab 34856 |
Copyright terms: Public domain | W3C validator |