PrimrecRel.forall_lt

∀ {R : ℕ → ℕ → Prop}, PrimrecRel R → PrimrecRel fun n y => ∀ x < n, R x y

If R a b is decidable, then for any fixed n and y, g n y ↔ ∀ x < n, R x y is a primitive recursive relation.

Defined in: Mathlib.Computability.Primrec.List
Cited by: 0 results in Mathlib
Foundations: Depth 98 from the axioms · uses propext, Classical.choice, Quot.sound

Around this declaration

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

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

Results whose statement or proof uses this declaration.

Nothing cites this yet.