Metamath Proof Explorer


Definition df-ps

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 PosetRel = r | Rel r r r r r r -1 = I r

Detailed syntax breakdown

Step Hyp Ref Expression
0 cps class PosetRel
1 vr setvar r
2 1 cv setvar r
3 2 wrel wff Rel r
4 2 2 ccom class r r
5 4 2 wss wff r r r
6 2 ccnv class r -1
7 2 6 cin class r r -1
8 cid class I
9 2 cuni class r
10 9 cuni class r
11 8 10 cres class I r
12 7 11 wceq wff r r -1 = I r
13 3 5 12 w3a wff Rel r r r r r r -1 = I r
14 13 1 cab class r | Rel r r r r r r -1 = I r
15 0 14 wceq wff PosetRel = r | Rel r r r r r r -1 = I r