proposition: Lemma last_char_in__drop n (str : String) (H : n < length str) ls : last_char_in str ls <-> last_char_in (drop n str) ls.
proof: Proof. unfold last_char_in; apply for_last_char__drop; assumption. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.ZArith.ZArith Fiat.Parsers.StringLike.Core Fiat.Parsers.StringLike.Properties Fiat.Parsers.StringLike.ForallChars Fiat.Common