Theorems · Theorem · logic and foundations

Turing.ListBlank.modifyNth.eq_def

∀ {Γ : Type u_1} [inst : Inhabited Γ] (f : Γ → Γ) (x : ℕ) (x_1 : Turing.ListBlank Γ),
  Turing.ListBlank.modifyNth f x x_1 =
    match x, x_1 with
    | 0, L => Turing.ListBlank.cons (f L.head) L.tail
    | n.succ, L => Turing.ListBlank.cons L.head (Turing.ListBlank.modifyNth f n L.tail)

Defined in: Mathlib.Computability.TuringMachine.Tape
Cited by: 0 results in Mathlib
Foundations: Depth 75 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes: Inhabited

Mathlib docs Source Loogle LeanSearch

Around this declaration

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

Cites5

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

Turing.ListBlankstatement and proof · cited by 68
Turing.ListBlank.consstatement and proof · cited by 31
Turing.ListBlank.tailstatement and proof · cited by 27
Turing.ListBlank.headstatement and proof · cited by 27
Turing.ListBlank.modifyNthstatement and proof · cited by 6

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.