Theorems · Theorem · order theory

Filter.Tendsto.atTop_pow

∀ {α : Type u_1} {M : Type u_2} [inst : CommMonoid M] [inst_1 : Preorder M] [IsOrderedMonoid M] {l : Filter α}
  {f : α → M}, Filter.Tendsto f l Filter.atTop → ∀ {n : ℕ}, 0 < n → Filter.Tendsto (fun x => f x ^ n) l Filter.atTop

Defined in

Mathlib.Order.Filter.AtTopBot.Monoid

Cited by

1 results in Mathlib

Foundations

Depth 55 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

CommMonoidPreorderIsOrderedMonoid