Theorems · Theorem · probability
MeasureTheory.le_hittingBtwn
∀ {Ω : Type u_1} {β : Type u_2} {ι : Type u_3} [inst : ConditionallyCompleteLinearOrder ι] {u : ι → Ω → β} {s : Set β}
{n m : ι}, n ≤ m → ∀ (ω : Ω), n ≤ MeasureTheory.hittingBtwn u s n m ω- Defined in
- Mathlib.Probability.Process.HittingTime
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Set.ofPredproof · cited by 6,101
- Set.Iccproof · cited by 1,702
- ConditionallyCompleteLinearOrderstatement and proof · cited by 542
- Set.mem_inter_iffproof · cited by 50
- MeasureTheory.hittingBtwnstatement · cited by 39
- le_csInfproof · cited by 36
Cited by6
Results whose statement or proof uses this declaration.
- MeasureTheory.upperCrossingTime_le_lowerCrossingTimeproof · cited by 7
- MeasureTheory.lowerCrossingTime_le_upperCrossingTime_succproof · cited by 6
- MeasureTheory.hittingBtwn_lt_iffproof · cited by 3
- MeasureTheory.le_hittingBtwn_of_existsproof · cited by 2
- MeasureTheory.Adapted.isStoppingTime_hittingBtwn_isStoppingTimeproof · cited by 2
- MeasureTheory.hittingBtwn_mem_Iccproof · cited by 0