proposition: Lemma IndexedBag_Empty_RepInv : IndexedBag_RepInv IndexedBag_bempty.
proof: Proof. unfold IndexedBag_RepInv. split. apply ibempty_RepInv. intro idx. split. - intro asmp. exfalso. apply (ibenumerate_empty idx). assumption. - intro asmp. exfalso. apply asmp. apply pempty_correct. 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.Structures.OrderedTypeEx