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