![]() |
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 2732 | . 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑥, 𝑦⟩ ∣ 𝜑} | |
2 | 1 | relopabi 5822 | 1 ⊢ Rel {⟨𝑥, 𝑦⟩ ∣ 𝜑} |
Colors of variables: wff setvar class |
Syntax hints: {copab 5210 Rel wrel 5681 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-11 2154 ax-12 2171 ax-ext 2703 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2710 df-cleq 2724 df-clel 2810 df-rab 3433 df-v 3476 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-sn 4629 df-pr 4631 df-op 4635 df-opab 5211 df-xp 5682 df-rel 5683 |
This theorem is referenced by: relmptopab 7658 pwfir 9178 bj-0nelopab 36250 |
Copyright terms: Public domain | W3C validator |