proposition: Lemma take_length {str n} : length (take n str) = min n (length str).
proof: Proof. destruct (le_ge_dec (length str) n). { rewrite take_long by assumption. rewrite Nat.min_r by assumption. reflexivity. } { rewrite take_short_length by assumption. rewrite Nat.min_l by assumption. reflexivity. } Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.ZArith.ZArith Fiat.Common Fiat.Common.List.Operations Fiat.Common.List.ListFacts Fiat.Common.Le Fiat.Common.Tactics.SetoidSubst Fiat.Common.Tactics.IsClosed Fiat.Parsers.StringLike.Core Fiat.Common.UIP