Theorems · Theorem · probability
MeasureTheory.exists_upperCrossingTime_eq
∀ {Ω : Type u_1} {a b : ℝ} (f : ℕ → Ω → ℝ) (N : ℕ) (ω : Ω), a < b → ∃ n, MeasureTheory.upperCrossingTime a b f N n ω = N- Cited by
- 2 results in Mathlib
- Foundations
- Depth 111 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Realstatement and proof · cited by 25,697
- Set.rangeproof · cited by 4,705
- StrictMonoproof · cited by 706
- lt_of_lt_of_leproof · cited by 438
- not_leproof · cited by 328
- MeasureTheory.upperCrossingTimestatement and proof · cited by 42
- strictMono_nat_of_lt_succproof · cited by 21
- StrictMono.id_leproof · cited by 14
- MeasureTheory.upperCrossingTime_leproof · cited by 10
- MeasureTheory.upperCrossingTime_lt_succproof · cited by 2
Cited by2
Results whose statement or proof uses this declaration.
- MeasureTheory.upperCrossingTime_lt_bddAboveproof · cited by 5
- MeasureTheory.upperCrossingTime_bound_eqproof · cited by 1