proposition: Lemma unfold_is_after_last_char_such_that str n P : is_after_last_char_such_that str n P <-> (forall_chars (drop n str) (fun ch => ~P ch) /\ for_last_char (take n str) P).
proof: Proof. reflexivity. 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.Parsers.StringLike.LastChar Fiat.Common