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