Theorems · Theorem · logic and foundations

PrimrecPred.exists_mem_list

∀ {α : Type u_1} {p : α → Prop} [inst : Primcodable α], PrimrecPred p → PrimrecPred fun L => ∃ a ∈ L, p a

Checking if any element of a list satisfies a decidable predicate is primitive recursive.

Defined in

Mathlib.Computability.Primrec.List

Cited by

1 results in Mathlib

Foundations

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

Assumes

Primcodable