proposition: Lemma strict_total_order_irrefl : forall A (R:binary A), strict_total_order R -> irrefl R.
proof: Proof. Proof using. introv [Tr Tk]. intros x. lets: (Tk x x). inverts~ H. Qed.
imports: TLC(LibTactics LibLogic LibReflect LibOperation LibRelation)