Theorems · Theorem · probability
MeasureTheory.hittingBtwn_mem_set
∀ {Ω : Type u_1} {β : Type u_2} {ι : Type u_3} [inst : ConditionallyCompleteLinearOrder ι] {u : ι → Ω → β} {s : Set β}
{n : ι} {ω : Ω} [WellFoundedLT ι] {m : ι},
(∃ j ∈ Set.Icc n m, u j ω ∈ s) → u (MeasureTheory.hittingBtwn u s n m ω) ω ∈ s- Defined in
- Mathlib.Probability.Process.HittingTime
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 21 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
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.Nonemptyproof · cited by 2,627
- Set.Iccstatement and proof · cited by 1,702
- InfSet.sInfproof · cited by 935
- ConditionallyCompleteLinearOrderstatement and proof · cited by 542
- WellFoundedLTstatement and proof · cited by 491
- Set.mem_inter_iffproof · cited by 50
- MeasureTheory.hittingBtwnstatement · cited by 39
- Set.mem_interproof · cited by 25
- csInf_memproof · cited by 19
Cited by2
Results whose statement or proof uses this declaration.
- MeasureTheory.hittingBtwn_le_iff_of_existsproof · cited by 1
- MeasureTheory.hittingBtwn_mem_set_of_hittingBtwn_ltproof · cited by 0