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