proposition: Lemma might_be_empty_pr_parse_of_item_nt (Hlen : length str = 0) (p : parse_of_item G str (NonTerminal nt)) : might_be_empty_of_pr_nt G nt = true.
proof: Proof. correct_t. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.MSets.MSetPositive Coq.Classes.Morphisms Fiat.Parsers.StringLike.FirstChar Fiat.Parsers.StringLike.LastChar Fiat.Parsers.StringLike.ForallChars Fiat.Parsers.ContextFreeGrammar.Core Fiat.Parsers.ContextFreeGrammar.PreNotations Fiat.Parsers.ContextFreeGrammar.Precompute Fiat.Parsers.StringLike.Properties Fiat.Parsers.Splitters.RDPList Fiat.Parsers.BaseTypes Fiat.Parsers.ContextFreeGrammar.Fix.FromAbstractInterpretationDefinitions Fiat.Parsers.ContextFreeGrammar.Fix.Fix Fiat.Parsers.ContextFreeGrammar.Fix.AsciiLattice Fiat.Parsers.ContextFreeGrammar.Fix.ProdAbstractInterpretationDefinitions Fiat.Parsers.ContextFreeGrammar.Fix.FromAbstractInterpretation Fiat.Parsers.Refinement.EmptyLemmas Fiat.Common.BoolFacts Fiat.Common.LogicFacts Fiat.Common.NatFacts Fiat.Common