fact: Definition permut (n : nat) (f : nat -> nat) := (forall i, n <= i -> f i = i) /\ (forall i, i < n -> f i < n) /\ (forall i j, i < n -> j < n -> f i = f j -> i = j).
imports: Coq(List Relations Multiset Arith Setoid) CoLoR(decidable_set more_list equiv_list)