proposition: Lemma take_neg : forall n l, n <= 0 -> take n l = nil.
proof: Proof. Proof using. intros. unfold take. rewrite~ to_nat_neg. Qed.
imports: TLC(LibTactics LibLogic LibOperation LibReflect LibProd LibNat LibInt LibOption LibWf) TLC(LibInt)