proposition: Lemma lime_sup_le f g a : (forall r, (0 < r)%R -> forall y, y != a -> ball a r y -> f y <= g y) -> lime_sup f a <= lime_sup g a.
proof: Proof. by move=> fg; rewrite !lime_sup_lim; apply: lee_lim => //; exact: le_sup_ball. Qed.
imports: mathcomp(all_ssreflect ssralg ssrint ssrnum finmap) mathcomp(matrix interval zmodp vector fieldext falgebra) mathcomp(mathcomp_extra boolp classical_sets functions) mathcomp(cardinality) ereal reals signed topology prodnormedzmodule normedtype derive sequences real_interval HB(structures)