proposition: Lemma arg_rmax2 : forall j, (F j <= F [arg max_(i > i0) F i]%O)%O.
proof: Proof. move=> j; case: (@Order.TotalTheory.arg_maxP _ _ I i0 xpredT F isT) => i _. exact. Qed.
imports: mathcomp(all_ssreflect) mathcomp(all_algebra vector reals normedtype) mathcomp(mathcomp_extra boolp) mathcomp(Rstruct) ssrR realType_ext Reals Lra mathcomp(lra)