proposition: Lemma nothing_empty_lt v : ~aggregate_state_lt (PositiveMap.empty _) v.
proof: Proof. setoid_rewrite PositiveMapExtensions.empty_ltb_nothing; [ congruence | ]. setoid_rewrite state_ge_top_eq_top. intros; symmetry; assumption. Qed.
imports: Coq.Init.Wf Coq.Numbers.BinNums Coq.Arith.Arith Coq.FSets.FMapPositive Fiat.Parsers.ContextFreeGrammar.Carriers Fiat.Parsers.ContextFreeGrammar.PreNotations Fiat.Parsers.Splitters.RDPList Fiat.Parsers.BaseTypes Fiat.Parsers.ContextFreeGrammar.Fix.Definitions Fiat.Parsers.ContextFreeGrammar.Fix.Properties Fiat.Common.FMapExtensions.Wf Fiat.Common Fiat.Common.OptionFacts Fiat.Common.SetoidInstances