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