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