proposition: Lemma Trie_Empty_RepInv : TrieBagRepInv (TrieBag_bempty).
proof: Proof. unfold TrieBagRepInv; intros; econstructor; simpl in *. apply bempty_RepInv. econstructor. intros; exfalso; eapply benumerate_empty; eauto. intros; exfalso; eapply empty_1; eauto. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Fiat.QueryStructure.Implementation.DataStructures.Bags.BagsInterface Fiat.QueryStructure.Implementation.DataStructures.Bags.BagsProperties Coq.FSets.FMapInterface Coq.FSets.FMapFacts Coq.FSets.FMapAVL Coq.ZArith.ZArith Fiat.Common Fiat.Common.List.ListFacts Fiat.Common.List.FlattenList Fiat.Common.SetEqProperties Fiat.Common.FMapExtensions Fiat.Common.List.PermutationFacts Fiat.QueryStructure.Specification.SearchTerms.ListPrefix