proposition: Lemma H4loss_draw_ge i : draw <= f1 i -> edraw <= f2 eloss edraw i.
proof: Proof. case: f1 (@H4loss_draw_draw i) (@H4loss_draw_win i) => //. by move=> _ /(_ (refl_equal _)) /(leq_trans _) H _; rewrite H. by move=> /(_ (refl_equal _)) /andP[]. Qed.
imports: HB(structures) mathcomp(all_ssreflect) mathcomp(all_algebra)