Definition df-drs

Description: Define the class of directed sets. A directed set is a nonempty preordered set where every pair of elements have some upper bound. Note that it is not required that there exist aleast upper bound.

There is no consensus in the literature over whether directed sets are allowed to be empty. It is slightly more convenient for us if they are not. (Contributed by Stefan O'Rear, 1-Feb-2015)

	Ref	Expression
Assertion	df-drs	|- Dirset = { f e. Proset | [. ( Base ` f ) / b ]. [. ( le ` f ) / r ]. ( b =/= (/) /\ A. x e. b A. y e. b E. z e. b ( x r z /\ y r z ) ) }

Detailed syntax breakdown

Step	Hyp	Ref	Expression
0		cdrs	|- Dirset
1		vf	|- f
2		cproset	|- Proset
3		cbs	|- Base
4	1	cv	|- f
5	4 3	cfv	|- ( Base ` f )
6		vb	|- b
7		cple	|- le
8	4 7	cfv	|- ( le ` f )
9		vr	|- r
10	6	cv	|- b
11		c0	|- (/)
12	10 11	wne	|- b =/= (/)
13		vx	|- x
14		vy	|- y
15		vz	|- z
16	13	cv	|- x
17	9	cv	|- r
18	15	cv	|- z
19	16 18 17	wbr	|- x r z
20	14	cv	|- y
21	20 18 17	wbr	|- y r z
22	19 21	wa	|- ( x r z /\ y r z )
23	22 15 10	wrex	|- E. z e. b ( x r z /\ y r z )
24	23 14 10	wral	|- A. y e. b E. z e. b ( x r z /\ y r z )
25	24 13 10	wral	|- A. x e. b A. y e. b E. z e. b ( x r z /\ y r z )
26	12 25	wa	|- ( b =/= (/) /\ A. x e. b A. y e. b E. z e. b ( x r z /\ y r z ) )
27	26 9 8	wsbc	|- [. ( le ` f ) / r ]. ( b =/= (/) /\ A. x e. b A. y e. b E. z e. b ( x r z /\ y r z ) )
28	27 6 5	wsbc	|- [. ( Base ` f ) / b ]. [. ( le ` f ) / r ]. ( b =/= (/) /\ A. x e. b A. y e. b E. z e. b ( x r z /\ y r z ) )
29	28 1 2	crab	|- { f e. Proset | [. ( Base ` f ) / b ]. [. ( le ` f ) / r ]. ( b =/= (/) /\ A. x e. b A. y e. b E. z e. b ( x r z /\ y r z ) ) }
30	0 29	wceq	|- Dirset = { f e. Proset | [. ( Base ` f ) / b ]. [. ( le ` f ) / r ]. ( b =/= (/) /\ A. x e. b A. y e. b E. z e. b ( x r z /\ y r z ) ) }