Theorems · Theorem · logic and foundations

Primrec.list_findIdx

∀ {α : Type u_1} {β : Type u_2} [inst : Primcodable α] [inst_1 : Primcodable β] {f : α → List β} {p : α → β → Bool},
  Primrec f → Primrec₂ p → Primrec fun a => List.findIdx (p a) (f a)

Defined in

Mathlib.Computability.Primrec.List

Cited by

3 results in Mathlib

Foundations

Depth 92 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

PrimcodablePrimcodable