Theorems · Theorem · measure theory
Measurable.find
∀ {α : Type u_1} {β : Type u_2} {mβ : MeasurableSpace β} {x : MeasurableSpace α} {f : ℕ → α → β} {p : ℕ → α → Prop}
[inst : (n : ℕ) → DecidablePred (p n)],
(∀ (n : ℕ), Measurable (f n)) →
(∀ (n : ℕ), MeasurableSet {x | p n x}) → ∀ (h : ∀ (x : α), ∃ n, p n x), Measurable fun x => f (Nat.find ⋯) xA piecewise function on countably many pieces is measurable if all the data is measurable.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 74 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidablePred
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.
- MeasurableSpacestatement and proof · cited by 13,106
- Set.ofPredstatement and proof · cited by 6,101
- MeasurableSetstatement and proof · cited by 3,075
- Measurablestatement and proof · cited by 1,499
- Measurable.compproof · cited by 234
- Nat.findstatement · cited by 139
- Measurable.prodMkproof · cited by 115
- measurable_idproof · cited by 89
- measurable_from_prod_countable_leftproof · cited by 6
- measurable_findproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Measurable.liminf'proof · cited by 2