Theorems · Theorem · logic and foundations
Turing.ListBlank.append_assoc
∀ {Γ : Type u_1} [inst : Inhabited Γ] (l₁ l₂ : List Γ) (l₃ : Turing.ListBlank Γ),
Turing.ListBlank.append (l₁ ++ l₂) l₃ = Turing.ListBlank.append l₁ (Turing.ListBlank.append l₂ l₃)- Defined in
- Mathlib.Computability.TuringMachine.Tape
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 76 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Inhabited
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.mkproof · cited by 22
- Turing.ListBlank.appendstatement and proof · cited by 7
- Turing.ListBlank.induction_onproof · cited by 5
- Turing.ListBlank.append_mkproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.