Mathlib Map

Theorems · Theorem · probability

MeasureTheory.upperCrossingTime_lt_succ

∀ {Ω : Type u_1} {a b : ℝ} {f : ℕ → Ω → ℝ} {N n : ℕ} {ω : Ω},
  a < b →
    MeasureTheory.upperCrossingTime a b f N (n + 1) ω ≠ N →
      MeasureTheory.upperCrossingTime a b f N n ω < MeasureTheory.upperCrossingTime a b f N (n + 1) ω
Defined in
Mathlib.Probability.Martingale.Upcrossing
Cited by
2 results in Mathlib
Foundations
Depth 110 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

MeasureTheory.exists_upperCrossingTime_eq · cited by 2MeasureTheory.exists_uppe…MeasureTheory.upperCrossingTime_bound_eq · cited by 1MeasureTheory.upperCrossi…Real · cited by 25697Reallt_of_le_of_lt · cited by 432lt_of_le_of_ltMeasureTheory.upperCrossingTime · cited by 42MeasureTheory.upperCrossi…MeasureTheory.upperCrossingTime_le_lowerCrossingTime · cited by 7MeasureTheory.upperCrossi…MeasureTheory.lowerCrossingTime_lt_upperCrossingTime · cited by 1MeasureTheory.lowerCrossi…MeasureTheory.upperCrossingTi…CITED BYCITES

Cites5

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by2

Results whose statement or proof uses this declaration.