proposition: Lemma minxx : idempotent (min : T -> T -> T).
proof: Proof. by rewrite /min => x; rewrite ltxx. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)