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