proposition: Lemma order_wrt_inverse : forall A (E:binary A) (R:binary A), order_wrt E R -> order_wrt E (inverse R).
proof: Proof. Proof using. hint trans_inverse, antisym_wrt_inverse. introv [Re Tr An]. constructor~. Qed.
imports: TLC(LibTactics LibLogic LibReflect LibOperation LibRelation)