proposition: Lemma comparable_lteif_maxl C : (Order.max x y < z ?<= if C) = (x < z ?<= if C) && (y < z ?<= if C).
proof: Proof. by case: C; rewrite /= (comparable_ge_max, comparable_gt_max). Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)