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