Theorems · Theorem · order theory

Filter.Tendsto.eventuallyLE_zero_add_atBot

∀ {α : Type u_1} {M : Type u_2} [inst : AddCommMonoid M] [inst_1 : Preorder M] [IsOrderedAddMonoid M] {l : Filter α}
  {f g : α → M}, f ≤ᶠ[l] 0 → Filter.Tendsto g l Filter.atBot → Filter.Tendsto (fun x => f x + g x) l Filter.atBot

Defined in

Mathlib.Order.Filter.AtTopBot.Monoid

Cited by

1 results in Mathlib

Foundations

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

Assumes

AddCommMonoidPreorderIsOrderedAddMonoid