proposition: Lemma InvertedIndex_Empty_RepInv : InvertedIndex_RepInv (InvertedIndex_bempty).
proof: Proof. unfold InvertedIndex_RepInv; intros; repeat split; simpl; intros. - exfalso; eapply MKeys.empty_1; eauto. - exfalso; eapply MValues.empty_1; eauto. - intro H'; destruct H'; eapply MValues.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.Arith.Peano_dec Coq.Structures.OrdersEx Coq.FSets.FMapInterface Coq.FSets.FMapFacts Coq.FSets.FMapAVL Coq.ZArith.ZArith Fiat.Common Fiat.Common.String_as_OT Fiat.Common.List.ListFacts Fiat.Common.List.FlattenList Fiat.Common.SetEqProperties Fiat.Common.FMapExtensions Fiat.Common.List.PermutationFacts Fiat.QueryStructure.Specification.SearchTerms.ListInclusion