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