Theorems · Theorem · order theory

Filter.Tendsto.atTop_of_le_const_mul

∀ {α : Type u_1} {M : Type u_2} [inst : CommMonoid M] [inst_1 : Preorder M] [IsOrderedCancelMonoid M] {l : Filter α}
  {f g : α → M},
  (∃ C, ∀ (x : α), f x ≤ C) → Filter.Tendsto (fun x => f x * g x) l Filter.atTop → Filter.Tendsto g l Filter.atTop

Defined in

Mathlib.Order.Filter.AtTopBot.Monoid

Cited by

1 results in Mathlib

Foundations

Depth 56 from the axioms · uses propext, Quot.sound

Assumes

CommMonoidPreorderIsOrderedCancelMonoid