Mathlib Map

Theorems · Definition · probability

BoundedRandom.recOn

{m : Type u → Type u_1} →
  {α : Type u} →
    [inst : Preorder α] →
      {motive : BoundedRandom m α → Sort u_2} →
        (t : BoundedRandom m α) →
          ((randomR : {g : Type} → (lo hi : α) → lo ≤ hi → [RandomGen g] → RandGT g m { a // lo ≤ a ∧ a ≤ hi }) →
              motive { randomR := randomR }) →
            motive t
Defined in
Mathlib.Control.Random
Cited by
0 results in Mathlib
Foundations
Depth 5 from the axioms · uses no axioms
Assumes
Preorder
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Preorder · cited by 7952PreorderBoundedRandom · cited by 0BoundedRandomRandGT · cited by 0RandGTBoundedRandom.recOnCITED BYCITES

Cites3

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

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.