proposition: Lemma find_after_last_char_such_that'_short {Char HSLM HSL} str P len : @find_after_last_char_such_that' Char HSLM HSL P len str <= len.
proof: Proof. revert str; induction len; simpl; intros; [ omega | ]. destruct (get len str) eqn:H. { edestruct P; try omega. rewrite IHlen; omega. } { rewrite IHlen; omega. } Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.ZArith.ZArith Coq.Lists.List Fiat.Parsers.Refinement.PreTactics Fiat.Computation.Refinements.General Fiat.Parsers.StringLike.LastCharSuchThat Fiat.Common.Equality Fiat.Common.List.Operations Fiat.Parsers.ContextFreeGrammar.ValidReflective Fiat.Parsers.Refinement.DisjointLemmas Fiat.Parsers.Refinement.DisjointRulesCommon Fiat.Parsers.Refinement.PossibleTerminalsSets Fiat.Parsers.ParserInterface Fiat.Common.List.DisjointFacts