A directed subset of a poset P is some subset D such that every pair of elements of D have an upper bound in D. We say P is directed-complete if every directed subset of P has a least upper bound.
Show that P is complete iff it is directed complete and every finite subset of P has a join.
I have no idea how you'd even begin to show the reverse implication.