Building coq lib for poset (using ListSet), almost at minimal member

Attacking partial order implication of minimal member programatically by
partitioning a set based on a pivot, which yields a set of <, >, and
unrelated elements, and will focus on decreasing the < set until it is
empty programatically.