proposition: Lemma Hlen0_take {len0 len0' str str' n} (Hlen0 : Hlen0T len0 len0' str str') (Hstr : str =s str') : Hlen0T len0 len0' (take n str) (take n str').
proof: Proof. setoid_subst str'. rewrite take_length. apply Nat.min_case_strong; omega. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.Strings.String Coq.Lists.List Coq.ZArith.ZArith Fiat.Parsers.ContextFreeGrammar.Core Fiat.Parsers.ContextFreeGrammar.Properties Fiat.Parsers.WellFoundedParse Fiat.Parsers.CorrectnessBaseTypes Fiat.Parsers.BaseTypes Fiat.Parsers.StringLike.Properties Fiat.Parsers.BaseTypesLemmas Fiat.Parsers.MinimalParse Fiat.Parsers.WellFoundedParseProperties Fiat.Common