proposition: Lemma IndexesToItems_perm : forall pool idxs idxs', Permutation idxs idxs' -> Permutation (IndexesToItems idxs pool) (IndexesToItems idxs' pool).
proof: Proof. unfold IndexesToItems; induction 1; eauto; simpl in *. - destruct (pget pool x); eauto. - destruct (pget pool x); destruct (pget pool y); eauto; apply perm_swap. - eapply perm_trans; 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.Structures.OrderedTypeEx