proposition: Lemma preorder_rclosure : forall A (R:binary A), preorder R -> preorder (rclosure R).
proof: Proof. Proof using. hint refl_rclosure, trans_rclosure. introv [Re Tr]. constructor~. Qed.
imports: TLC(LibTactics LibLogic LibReflect LibOperation LibRelation)