Cslib.SKI.Church_succ
theoremverifiedformalizationimported Lean
Cslib.SKI.Church_succ
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in @[simp] lemma Cslib.SKI.Church_succ (n : Nat) (f x : SKI) : Church (n+1) f x = f ⬝ Church n f x
- Formalizes
- CSLib, `Cslib.SKI.Church_succ`
- Lean proof
- By Thomas Waring, Jesse Alama, 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.Church_succ← Cslib.SKI.Church_succ (Cslib/Languages/CombinatoryLogic/Recursion.lean:75): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 4
- Cslib.SKI.ChurchFunction form of the church numerals.
- Cslib.SKI.Church_zeroCslib.SKI.Church_zero
- Cslib.SKIAn SKI expression is built from the primitive combinators
S,KandI, and application. - Cslib.SKI.CoeTermPolynomialCslib.SKI.CoeTermPolynomial
- Used by 1
- Cslib.SKI.ZeroChurch zero := λ f x. x
Lean source view module on GitHub
open Cslib.SKI @[inherit_doc] local infixl:100 " ⬝ " => app set_option autoImplicit true in set_option relaxedAutoImplicit true in @[simp] lemma Cslib.SKI.Church_succ (n : Nat) (f x : SKI) : Church (n+1) f x = f ⬝ Church n f x := rfl