proposition: Lemma totalT : total (<=%O : rel T).
proof: Proof. by move=> x y; rewrite -!f_mono le_total. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)