Description: Define the class of all posets (partially ordered sets) with weak ordering (e.g., "less than or equal to" instead of "less than"). A poset is a relation which is transitive, reflexive, and antisymmetric. (Contributed by NM, 11-May-2008)
Ref | Expression | ||
---|---|---|---|
Assertion | df-ps | |
Step | Hyp | Ref | Expression |
---|---|---|---|
0 | cps | |
|
1 | vr | |
|
2 | 1 | cv | |
3 | 2 | wrel | |
4 | 2 2 | ccom | |
5 | 4 2 | wss | |
6 | 2 | ccnv | |
7 | 2 6 | cin | |
8 | cid | |
|
9 | 2 | cuni | |
10 | 9 | cuni | |
11 | 8 10 | cres | |
12 | 7 11 | wceq | |
13 | 3 5 12 | w3a | |
14 | 13 1 | cab | |
15 | 0 14 | wceq | |