Theorems · Theorem · logic and foundations
RecursiveIn.mono
∀ {α : Type u_1} {σ : Type u_4} [inst : Primcodable α] [inst_1 : Primcodable σ] {f : α →. σ} {O₁ O₂ : Set (ℕ →. ℕ)},
O₁ ⊆ O₂ → RecursiveIn O₁ f → RecursiveIn O₂ fMonotonicity of RecursiveIn with respect to oracle sets.
- Defined in
- Mathlib.Computability.RecursiveIn
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 28 from the axioms · uses propext, Quot.sound
- Assumes
- PrimcodablePrimcodable
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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
- Primcodablestatement and proof · cited by 325
- PFunstatement and proof · cited by 207
- RecursiveInstatement and proof · cited by 15
- RecursiveIn.substproof · cited by 2
- RecursiveIn.oracleproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.