Cslib.SKI.applyList_concat
theoremverifiedformalizationimported Lean
Cslib.SKI.applyList_concat
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in lemma Cslib.SKI.applyList_concat (f : SKI) (ys : List SKI) (z : SKI) : f.applyList (ys ++ [z]) = f.applyList ys ⬝ z
- Formalizes
- CSLib, `Cslib.SKI.applyList_concat`
- Lean proof
- By Thomas Waring, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2025 Thomas Waring. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.Cslib.SKI.applyList_concat← Cslib.SKI.applyList_concat (Cslib/Languages/CombinatoryLogic/Defs.lean:62): verbatim
- Verified
- 08 Oct 2026
- Axioms
Quot.soundpropext- Built on 2
- Cslib.SKI.applyListApply a term to a list of terms
- Cslib.SKIAn SKI expression is built from the primitive combinators
S,KandI, and application.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
open Cslib.SKI@[inherit_doc]local infixl:100 " ⬝ " => appset_option autoImplicit true inset_option relaxedAutoImplicit true inlemma Cslib.SKI.applyList_concat (f : SKI) (ys : List SKI) (z : SKI) : f.applyList (ys ++ [z]) = f.applyList ys ⬝ z := by simp [applyList]