Loogle!
Result
Found 130 declarations mentioning Primrec.
- Primrec.not 📋 Mathlib.Computability.Primrec.Basic
: Primrec not - Primrec.nat_bodd 📋 Mathlib.Computability.Primrec.Basic
: Primrec Nat.bodd - Primrec 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} [Primcodable α] [Primcodable β] (f : α → β) : Prop - Primrec.id 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] : Primrec id - Primrec.nat_div2 📋 Mathlib.Computability.Primrec.Basic
: Primrec Nat.div2 - Primrec.succ 📋 Mathlib.Computability.Primrec.Basic
: Primrec Nat.succ - Primrec.dom_bool 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] (f : Bool → α) : Primrec f - Primrec.pred 📋 Mathlib.Computability.Primrec.Basic
: Primrec Nat.pred - Primrec.option_isSome 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] : Primrec Option.isSome - Primrec.option_some 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] : Primrec some - Primrec.const 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {σ : Type u_3} [Primcodable α] [Primcodable σ] (x : σ) : Primrec fun x_1 => x - Primrec.encode 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] : Primrec Encodable.encode - Primrec.fin_val 📋 Mathlib.Computability.Primrec.Basic
{n : ℕ} : Primrec fun i => ↑i - Primrec.nat_iff 📋 Mathlib.Computability.Primrec.Basic
{f : ℕ → ℕ} : Primrec f ↔ Nat.Primrec f - Primrec.ofNat 📋 Mathlib.Computability.Primrec.Basic
(α : Type u_4) [Denumerable α] : Primrec (Denumerable.ofNat α) - Primrec.dom_finite 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {σ : Type u_3} [Primcodable α] [Primcodable σ] [Finite α] (f : α → σ) : Primrec f - Primrec.decode 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] : Primrec Encodable.decode - Primrec.decode₂ 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] : Primrec (Encodable.decode₂ α) - Primrec.unpair 📋 Mathlib.Computability.Primrec.Basic
: Primrec Nat.unpair - Primrec.ulower_down 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] : Primrec ULower.down - Primrec.ulower_up 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] : Primrec ULower.up - Primrec.fst 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_2} {β : Type u_3} [Primcodable α] [Primcodable β] : Primrec Prod.fst - Primrec.snd 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_2} {β : Type u_3} [Primcodable α] [Primcodable β] : Primrec Prod.snd - Primrec.sumInl 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} [Primcodable α] [Primcodable β] : Primrec Sum.inl - Primrec.sumInr 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} [Primcodable α] [Primcodable β] : Primrec Sum.inr - Primrec.option_getD_default 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] [Inhabited α] : Primrec fun o => o.getD default - Primrec.list_idxOf₁ 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] [DecidableEq α] (l : List α) : Primrec fun a => List.idxOf a l - Primrec.nat_double 📋 Mathlib.Computability.Primrec.Basic
: Primrec fun n => 2 * n - Primrec.primrecPred 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] {p : α → Prop} [DecidablePred p] (hp : Primrec fun a => decide (p a)) : PrimrecPred p - PrimrecPred.decide 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] {p : α → Prop} [DecidablePred p] (hp : PrimrecPred p) : Primrec fun a => decide (p a) - primrecPred_iff_primrec_decide 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] {p : α → Prop} [DecidablePred p] : PrimrecPred p ↔ Primrec fun a => decide (p a) - Primrec.encdec 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] : Primrec fun n => Encodable.encode (Encodable.decode n) - Primrec.subtype_val 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] {p : α → Prop} [DecidablePred p] {hp : PrimrecPred p} : Primrec Subtype.val - PrimrecPred.comp 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} [Primcodable α] [Primcodable β] {p : β → Prop} {f : α → β} (hp : PrimrecPred p) (hf : Primrec f) : PrimrecPred fun a => p (f a) - Primrec.fin_val_iff 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] {n : ℕ} {f : α → Fin n} : (Primrec fun a => ↑(f a)) ↔ Primrec f - Primrec.nat_casesOn₁ 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] {f : ℕ → α} (a : α) (hf : Primrec f) : Primrec fun n => Nat.casesOn n a f - Primrec.option_some_iff 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {σ : Type u_3} [Primcodable α] [Primcodable σ] {f : α → σ} : (Primrec fun a => some (f a)) ↔ Primrec f - Primrec.dom_denumerable 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_4} {β : Type u_5} [Denumerable α] [Primcodable β] {f : α → β} : Primrec f ↔ Nat.Primrec fun n => Encodable.encode (f (Denumerable.ofNat α n)) - Primrec.of_eq 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {σ : Type u_3} [Primcodable α] [Primcodable σ] {f g : α → σ} (hf : Primrec f) (H : ∀ (n : α), f n = g n) : Primrec g - Primrec.option_map₁ 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {σ : Type u_3} [Primcodable α] [Primcodable σ] {f : α → σ} (hf : Primrec f) : Primrec (Option.map f) - Primrec₂.unpaired 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] {f : ℕ → ℕ → α} : Primrec (Nat.unpaired f) ↔ Primrec₂ f - Primrec.encode_iff 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {σ : Type u_3} [Primcodable α] [Primcodable σ] {f : α → σ} : (Primrec fun a => Encodable.encode (f a)) ↔ Primrec f - Primrec.ofNat_iff 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_4} {β : Type u_5} [Denumerable α] [Primcodable β] {f : α → β} : Primrec f ↔ Primrec fun n => f (Denumerable.ofNat α n) - Primrec.nat_rec₁ 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] {f : ℕ → α → α} (a : α) (hf : Primrec₂ f) : Primrec fun t => Nat.rec a f t - Primrec.list_findIdx₁ 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} [Primcodable α] [Primcodable β] {p : α → β → Bool} (hp : Primrec₂ p) (l : List β) : Primrec fun a => List.findIdx (p a) l - Primrec.of_equiv 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] {β : Type u_4} {e : β ≃ α} : Primrec ⇑e - Primrec.comp 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} {σ : Type u_3} [Primcodable α] [Primcodable β] [Primcodable σ] {f : β → σ} {g : α → β} (hf : Primrec f) (hg : Primrec g) : Primrec fun a => f (g a) - Primrec.list_getElem?₁ 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] (l : List α) : Primrec fun x => l[x]? - Primrec.nat_double_succ 📋 Mathlib.Computability.Primrec.Basic
: Primrec fun n => 2 * n + 1 - Primrec.of_graph 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] {f : α → ℕ} (h₁ : Primrec.PrimrecBounded f) (h₂ : PrimrecRel fun a b => f a = b) : Primrec f - Primrec.fin_succ 📋 Mathlib.Computability.Primrec.Basic
{n : ℕ} : Primrec Fin.succ - Primrec.of_equiv_symm 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] {β : Type u_4} {e : β ≃ α} : Primrec ⇑e.symm - Primrec.option_bind₁ 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {σ : Type u_3} [Primcodable α] [Primcodable σ] {f : α → Option σ} (hf : Primrec f) : Primrec fun o => o.bind f - Primrec₂.uncurry 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} {σ : Type u_3} [Primcodable α] [Primcodable β] [Primcodable σ] {f : α → β → σ} : Primrec (Function.uncurry f) ↔ Primrec₂ f - Primrec.option_get 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} [Primcodable α] [Primcodable β] {f : α → Option β} {h : ∀ (a : α), (f a).isSome = true} : Primrec f → Primrec fun a => (f a).get ⋯ - Primrec₂.curry 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} {σ : Type u_3} [Primcodable α] [Primcodable β] [Primcodable σ] {f : α × β → σ} : Primrec₂ (Function.curry f) ↔ Primrec f - Primrec.to₂ 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} {σ : Type u_3} [Primcodable α] [Primcodable β] [Primcodable σ] {f : α × β → σ} (hf : Primrec f) : Primrec₂ fun a b => f (a, b) - Primrec.nat_findGreatest 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} [Primcodable α] {f : α → ℕ} {p : α → ℕ → Prop} [DecidableRel p] (hf : Primrec f) (hp : PrimrecRel p) : Primrec fun x => Nat.findGreatest (p x) (f x) - PrimrecRel.comp 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} {γ : Type u_3} [Primcodable α] [Primcodable β] [Primcodable γ] {R : β → γ → Prop} {f : α → β} {g : α → γ} (hR : PrimrecRel R) (hf : Primrec f) (hg : Primrec g) : PrimrecPred fun a => R (f a) (g a) - Primrec₂.mk 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} {σ : Type u_3} [Primcodable α] [Primcodable β] [Primcodable σ] {f : α → β → σ} (hf : Primrec fun p => f p.1 p.2) : Primrec₂ f - Primrec.comp₂ 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} {γ : Type u_3} {σ : Type u_5} [Primcodable α] [Primcodable β] [Primcodable γ] [Primcodable σ] {f : γ → σ} {g : α → β → γ} (hf : Primrec f) (hg : Primrec₂ g) : Primrec₂ fun a b => f (g a b) - Primrec.cond 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {σ : Type u_3} [Primcodable α] [Primcodable σ] {c : α → Bool} {f g : α → σ} (hc : Primrec c) (hf : Primrec f) (hg : Primrec g) : Primrec fun a => bif c a then f a else g a - Primrec.pair 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Primcodable α] [Primcodable β] [Primcodable γ] {f : α → β} {g : α → γ} (hf : Primrec f) (hg : Primrec g) : Primrec fun a => (f a, g a) - Primrec.subtype_val_iff 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} [Primcodable α] [Primcodable β] {p : β → Prop} [DecidablePred p] {hp : PrimrecPred p} {f : α → Subtype p} : (Primrec fun a => ↑(f a)) ↔ Primrec f - Primrec.nat_casesOn' 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} [Primcodable α] [Primcodable β] {f : α → β} {g : α → ℕ → β} (hf : Primrec f) (hg : Primrec₂ g) : Primrec₂ fun a n => Nat.casesOn n (f a) (g a) - Primrec.ite 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {σ : Type u_3} [Primcodable α] [Primcodable σ] {c : α → Prop} [DecidablePred c] {f g : α → σ} (hc : PrimrecPred c) (hf : Primrec f) (hg : Primrec g) : Primrec fun a => if c a then f a else g a - Primrec.subtype_mk 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} [Primcodable α] [Primcodable β] {p : β → Prop} [DecidablePred p] {hp : PrimrecPred p} {f : α → β} {h : ∀ (a : α), p (f a)} (hf : Primrec f) : Primrec fun a => ⟨f a, ⋯⟩ - Primrec.of_equiv_iff 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {σ : Type u_3} [Primcodable α] [Primcodable σ] {β : Type u_4} (e : β ≃ α) {f : σ → β} : (Primrec fun a => e (f a)) ↔ Primrec f - Primrec.option_guard 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} [Primcodable α] [Primcodable β] {p : α → β → Prop} [DecidableRel p] (hp : PrimrecRel p) {f : α → β} (hf : Primrec f) : Primrec fun a => Option.guard (fun b => decide (p a b)) (f a) - Primrec.option_map 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} {σ : Type u_3} [Primcodable α] [Primcodable β] [Primcodable σ] {f : α → Option β} {g : α → β → σ} (hf : Primrec f) (hg : Primrec₂ g) : Primrec fun a => Option.map (g a) (f a) - Primrec.nat_iterate 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} [Primcodable α] [Primcodable β] {f : α → ℕ} {g : α → β} {h : α → β → β} (hf : Primrec f) (hg : Primrec g) (hh : Primrec₂ h) : Primrec fun a => (h a)^[f a] (g a) - Primrec₂.comp 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} {γ : Type u_3} {σ : Type u_5} [Primcodable α] [Primcodable β] [Primcodable γ] [Primcodable σ] {f : β → γ → σ} {g : α → β} {h : α → γ} (hf : Primrec₂ f) (hg : Primrec g) (hh : Primrec h) : Primrec fun a => f (g a) (h a) - Primrec.of_equiv_symm_iff 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {σ : Type u_3} [Primcodable α] [Primcodable σ] {β : Type u_4} (e : β ≃ α) {f : σ → α} : (Primrec fun a => e.symm (f a)) ↔ Primrec f - Primrec.nat_casesOn 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} [Primcodable α] [Primcodable β] {f : α → ℕ} {g : α → β} {h : α → ℕ → β} (hf : Primrec f) (hg : Primrec g) (hh : Primrec₂ h) : Primrec fun a => Nat.casesOn (f a) (g a) (h a) - Primrec.option_bind 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} {σ : Type u_3} [Primcodable α] [Primcodable β] [Primcodable σ] {f : α → Option β} {g : α → β → Option σ} (hf : Primrec f) (hg : Primrec₂ g) : Primrec fun a => (f a).bind (g a) - Primrec.option_casesOn 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} {σ : Type u_3} [Primcodable α] [Primcodable β] [Primcodable σ] {o : α → Option β} {f : α → σ} {g : α → β → σ} (ho : Primrec o) (hf : Primrec f) (hg : Primrec₂ g) : Primrec fun a => Option.casesOn (o a) (f a) (g a) - Primrec.nat_rec 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} [Primcodable α] [Primcodable β] {f : α → β} {g : α → ℕ × β → β} (hf : Primrec f) (hg : Primrec₂ g) : Primrec₂ fun a n => Nat.rec (f a) (fun n IH => g a (n, IH)) n - Primrec.nat_rec' 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} [Primcodable α] [Primcodable β] {f : α → ℕ} {g : α → β} {h : α → ℕ × β → β} (hf : Primrec f) (hg : Primrec g) (hh : Primrec₂ h) : Primrec fun a => Nat.rec (g a) (fun n IH => h a (n, IH)) (f a) - Primrec.sumCasesOn 📋 Mathlib.Computability.Primrec.Basic
{α : Type u_1} {β : Type u_2} {γ : Type u_3} {σ : Type u_4} [Primcodable α] [Primcodable β] [Primcodable γ] [Primcodable σ] {f : α → β ⊕ γ} {g : α → β → σ} {h : α → γ → σ} (hf : Primrec f) (hg : Primrec₂ g) (hh : Primrec₂ h) : Primrec fun a => Sum.casesOn (f a) (g a) (h a) - Primrec.nat_sqrt 📋 Mathlib.Computability.Primrec.List
: Primrec Nat.sqrt - Primrec.list_range 📋 Mathlib.Computability.Primrec.List
: Primrec List.range - Primrec.list_length 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} [Primcodable α] : Primrec List.length - Primrec.list_head? 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} [Primcodable α] : Primrec List.head? - Primrec.list_headI 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} [Primcodable α] [Inhabited α] : Primrec List.headI - Primrec.list_reverse 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} [Primcodable α] : Primrec List.reverse - Primrec.list_tail 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} [Primcodable α] : Primrec List.tail - Primrec.optionToList 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} [Primcodable α] : Primrec Option.toList - Primrec.vector_head 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} [Primcodable α] {n : ℕ} : Primrec List.Vector.head - Primrec.vector_length 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} [Primcodable α] {n : ℕ} : Primrec List.Vector.length - Primrec.list_flatten 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} [Primcodable α] : Primrec List.flatten - Primrec.vector_toList 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} [Primcodable α] {n : ℕ} : Primrec List.Vector.toList - Primrec.vector_get' 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} [Primcodable α] {n : ℕ} : Primrec List.Vector.get - Primrec.vector_ofFn' 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} [Primcodable α] {n : ℕ} : Primrec List.Vector.ofFn - Nat.Primrec'.of_prim 📋 Mathlib.Computability.Primrec.List
{n : ℕ} {f : List.Vector ℕ n → ℕ} : Primrec f → Nat.Primrec' f - Nat.Primrec'.to_prim 📋 Mathlib.Computability.Primrec.List
{n : ℕ} {f : List.Vector ℕ n → ℕ} (pf : Nat.Primrec' f) : Primrec f - Nat.Primrec'.prim_iff 📋 Mathlib.Computability.Primrec.List
{n : ℕ} {f : List.Vector ℕ n → ℕ} : Nat.Primrec' f ↔ Primrec f - Primrec.list_dropWhile 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} [Primcodable α] {p : α → Bool} (hp : Primrec p) : Primrec (List.dropWhile p) - Primrec.list_modifyHead 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} [Primcodable α] {f : α → α} (hf : Primrec f) : Primrec (List.modifyHead f) - Primrec.list_takeWhile 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} [Primcodable α] {p : α → Bool} (hp : Primrec p) : Primrec (List.takeWhile p) - Primrec.fin_curry₁ 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} {σ : Type u_3} [Primcodable α] [Primcodable σ] {n : ℕ} {f : Fin n → α → σ} : Primrec₂ f ↔ ∀ (i : Fin n), Primrec (f i) - Primrec.fin_curry 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} {σ : Type u_3} [Primcodable α] [Primcodable σ] {n : ℕ} {f : α → Fin n → σ} : Primrec f ↔ Primrec₂ f - Nat.Primrec'.vec_iff 📋 Mathlib.Computability.Primrec.List
{m n : ℕ} {f : List.Vector ℕ m → List.Vector ℕ n} : Nat.Primrec'.Vec f ↔ Primrec f - Primrec.listFilter 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} [Primcodable α] {p : α → Prop} [DecidablePred p] (hf : PrimrecPred p) : Primrec fun L => List.filter (fun x => decide (p x)) L - Primrec.list_modify 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} [Primcodable α] {f : α → α} (hf : Primrec f) : Primrec₂ fun l n => l.modify n f - Nat.Primrec'.prim_iff₁ 📋 Mathlib.Computability.Primrec.List
{f : ℕ → ℕ} : (Nat.Primrec' fun v => f v.head) ↔ Primrec f - Primrec.list_ofFn 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} {σ : Type u_3} [Primcodable α] [Primcodable σ] {n : ℕ} {f : Fin n → α → σ} : (∀ (i : Fin n), Primrec (f i)) → Primrec fun a => List.ofFn fun i => f i a - Primrec.vector_toList_iff 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} {β : Type u_2} [Primcodable α] [Primcodable β] {n : ℕ} {f : α → List.Vector β n} : (Primrec fun a => (f a).toList) ↔ Primrec f - Primrec.vector_ofFn 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} {σ : Type u_3} [Primcodable α] [Primcodable σ] {n : ℕ} {f : Fin n → α → σ} (hf : ∀ (i : Fin n), Primrec (f i)) : Primrec fun a => List.Vector.ofFn fun i => f i a - Primrec.list_findIdx 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} {β : Type u_2} [Primcodable α] [Primcodable β] {f : α → List β} {p : α → β → Bool} (hf : Primrec f) (hp : Primrec₂ p) : Primrec fun a => List.findIdx (p a) (f a) - PrimrecPred.listFilter_listRange 📋 Mathlib.Computability.Primrec.List
{R : ℕ → ℕ → Prop} (s : ℕ) [DecidableRel R] (hf : PrimrecRel R) : Primrec fun n => List.filter (fun y => decide (R y n)) (List.range s) - Primrec.vector_tail 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} [Primcodable α] {n : ℕ} : Primrec List.Vector.tail - Primrec.list_map 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} {β : Type u_2} {σ : Type u_3} [Primcodable α] [Primcodable β] [Primcodable σ] {f : α → List β} {g : α → β → σ} (hf : Primrec f) (hg : Primrec₂ g) : Primrec fun a => List.map (g a) (f a) - Primrec.listFilterMap 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} {β : Type u_2} {σ : Type u_3} [Primcodable α] [Primcodable β] [Primcodable σ] {f : α → List β} {g : α → β → Option σ} (hf : Primrec f) (hg : Primrec₂ g) : Primrec fun a => List.filterMap (g a) (f a) - Primrec.list_flatMap 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} {β : Type u_2} {σ : Type u_3} [Primcodable α] [Primcodable β] [Primcodable σ] {f : α → List β} {g : α → β → List σ} (hf : Primrec f) (hg : Primrec₂ g) : Primrec fun a => List.flatMap (g a) (f a) - Primrec.list_foldl 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} {β : Type u_2} {σ : Type u_3} [Primcodable α] [Primcodable β] [Primcodable σ] {f : α → List β} {g : α → σ} {h : α → σ × β → σ} : Primrec f → Primrec g → Primrec₂ h → Primrec fun a => List.foldl (fun s b => h a (s, b)) (g a) (f a) - Primrec.list_foldr 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} {β : Type u_2} {σ : Type u_3} [Primcodable α] [Primcodable β] [Primcodable σ] {f : α → List β} {g : α → σ} {h : α → β × σ → σ} (hf : Primrec f) (hg : Primrec g) (hh : Primrec₂ h) : Primrec fun a => List.foldr (fun b s => h a (b, s)) (g a) (f a) - Primrec.list_casesOn 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} {β : Type u_2} {σ : Type u_3} [Primcodable α] [Primcodable β] [Primcodable σ] {f : α → List β} {g : α → σ} {h : α → β × List β → σ} : Primrec f → Primrec g → Primrec₂ h → Primrec fun a => List.casesOn (f a) (g a) fun b l => h a (b, l) - Primrec.nat_omega_rec' 📋 Mathlib.Computability.Primrec.List
{β : Type u_2} {σ : Type u_3} [Primcodable β] [Primcodable σ] (f : β → σ) {m : β → ℕ} {l : β → List β} {g : β → List σ → Option σ} (hm : Primrec m) (hl : Primrec l) (hg : Primrec₂ g) (Ord : ∀ (b b' : β), b' ∈ l b → m b' < m b) (H : ∀ (b : β), g b (List.map f (l b)) = some (f b)) : Primrec f - Primrec.list_rec 📋 Mathlib.Computability.Primrec.List
{α : Type u_1} {β : Type u_2} {σ : Type u_3} [Primcodable α] [Primcodable β] [Primcodable σ] {f : α → List β} {g : α → σ} {h : α → β × List β × σ → σ} (hf : Primrec f) (hg : Primrec g) (hh : Primrec₂ h) : Primrec fun a => List.recOn (f a) (g a) fun b l IH => h a (b, l, IH) - Primrec.to_comp 📋 Mathlib.Computability.Partrec
{α : Type u_1} {σ : Type u_2} [Primcodable α] [Primcodable σ] {f : α → σ} (hf : Primrec f) : Computable f - Nat.Partrec.Code.primrec_const 📋 Mathlib.Computability.PartrecCode
: Primrec Nat.Partrec.Code.const - Nat.Partrec.Code.primrec_rfind' 📋 Mathlib.Computability.PartrecCode
: Primrec Nat.Partrec.Code.rfind' - Nat.Partrec.Code.primrec_evaln 📋 Mathlib.Computability.PartrecCode
: Primrec fun a => Nat.Partrec.Code.evaln a.1.1 a.1.2 a.2 - Nat.Partrec.Code.primrec_recOn' 📋 Mathlib.Computability.PartrecCode
{α : Type u_1} {σ : Type u_2} [Primcodable α] [Primcodable σ] {c : α → Nat.Partrec.Code} (hc : Primrec c) {z : α → σ} (hz : Primrec z) {s : α → σ} (hs : Primrec s) {l : α → σ} (hl : Primrec l) {r : α → σ} (hr : Primrec r) {pr : α → Nat.Partrec.Code × Nat.Partrec.Code × σ × σ → σ} (hpr : Primrec₂ pr) {co : α → Nat.Partrec.Code × Nat.Partrec.Code × σ × σ → σ} (hco : Primrec₂ co) {pc : α → Nat.Partrec.Code × Nat.Partrec.Code × σ × σ → σ} (hpc : Primrec₂ pc) {rf : α → Nat.Partrec.Code × σ → σ} (hrf : Primrec₂ rf) : have PR := fun a cf cg hf hg => pr a (cf, cg, hf, hg); have CO := fun a cf cg hf hg => co a (cf, cg, hf, hg); have PC := fun a cf cg hf hg => pc a (cf, cg, hf, hg); have RF := fun a cf hf => rf a (cf, hf); have F := fun a c => Nat.Partrec.Code.recOn c (z a) (s a) (l a) (r a) (PR a) (CO a) (PC a) (RF a); Primrec fun a => F a (c a) - Nat.Partrec.Code.primrec_recOn 📋 Mathlib.Computability.PartrecCode
{α : Type u_1} {σ : Type u_2} [Primcodable α] [Primcodable σ] {c : α → Nat.Partrec.Code} (hc : Primrec c) {z : α → σ} (hz : Primrec z) {s : α → σ} (hs : Primrec s) {l : α → σ} (hl : Primrec l) {r : α → σ} (hr : Primrec r) {pr : α → Nat.Partrec.Code → Nat.Partrec.Code → σ → σ → σ} (hpr : Primrec fun a => pr a.1 a.2.1 a.2.2.1 a.2.2.2.1 a.2.2.2.2) {co : α → Nat.Partrec.Code → Nat.Partrec.Code → σ → σ → σ} (hco : Primrec fun a => co a.1 a.2.1 a.2.2.1 a.2.2.2.1 a.2.2.2.2) {pc : α → Nat.Partrec.Code → Nat.Partrec.Code → σ → σ → σ} (hpc : Primrec fun a => pc a.1 a.2.1 a.2.2.1 a.2.2.2.1 a.2.2.2.2) {rf : α → Nat.Partrec.Code → σ → σ} (hrf : Primrec fun a => rf a.1 a.2.1 a.2.2) : have F := fun a c => Nat.Partrec.Code.recOn c (z a) (s a) (l a) (r a) (pr a) (co a) (pc a) (rf a); Primrec fun a => F a (c a) - Nat.Partrec.Code.primrec_pappAck 📋 Mathlib.Computability.Ackermann
: Primrec Nat.Partrec.Code.pappAck - Nat.Partrec.Code.primrec_pappAck_step 📋 Mathlib.Computability.Ackermann
: Primrec Nat.Partrec.Code.pappAck.step - not_primrec_ack_self 📋 Mathlib.Computability.Ackermann
: ¬Primrec fun n => ack n n - Nat.Partrec'.of_prim 📋 Mathlib.Computability.PartrecBasis
{n : ℕ} {f : List.Vector ℕ n → ℕ} (hf : Primrec f) : Nat.Partrec' ↑f - Primrec.computableIn 📋 Mathlib.Computability.RecursiveIn
{α : Type u_1} {σ : Type u_3} [Primcodable α] [Primcodable σ] {f : α → σ} {O : Set (ℕ →. ℕ)} (hf : Primrec f) : ComputableIn O f
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision 69fae59