proposition: Lemma aggregate_state_lt_wf : well_founded (Basics.flip aggregate_state_lt).
proof: Proof. apply PositiveMapExtensions.well_founded_lift_gtb. { eapply Wf.well_founded_subrelation; [ | eexact (@state_gt_wf _ gdata) ]. unfold flip, state_le; intros x y H. destruct (y < x); [ reflexivity | simpl in * ]. destruct (y =b x) eqn:Heqb; simpl in *; assumption. } { apply top_top. } { exact _. } { exact _. } { exact _. } { exact _. } Defined.
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