Theorems · Theorem · order theory
Filter.Tendsto.atTop_of_const_add
∀ {α : Type u_1} {M : Type u_2} [inst : AddCommMonoid M] [inst_1 : Preorder M] [IsOrderedCancelAddMonoid M]
{l : Filter α} {f : α → M} (C : M), Filter.Tendsto (fun x => C + f x) l Filter.atTop → Filter.Tendsto f l Filter.atTop- Defined in
- Mathlib.Order.Filter.AtTopBot.Monoid
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 54 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- AddCommMonoidstatement and proof · cited by 12,281
- Filterstatement and proof · cited by 8,121
- Preorderstatement and proof · cited by 7,952
- Filter.Tendstostatement and proof · cited by 3,814
- Filter.atTopstatement and proof · cited by 2,405
- Filter.Eventually.monoproof · cited by 646
- IsOrderedCancelAddMonoidstatement and proof · cited by 359
- Filter.tendsto_atTopproof · cited by 24
- le_of_add_le_add_leftproof · cited by 15
Cited by2
Results whose statement or proof uses this declaration.
- Filter.Tendsto.atTop_of_isBoundedUnder_le_addproof · cited by 3
- Filter.Tendsto.atBot_of_const_addproof · cited by 0