All proofs
Project-declaredLean 4.33.0-rc1 · mathlib@169c26b52a38

Standard subst

Cslib.LambdaCalculus.LocallyNameless.Untyped.Term.Standard.subst

Plain-language statement

Standard reduction is preserved by substitution.

Exact Lean statement

lemma Standard.subst (hM : M ⭢ₛ M') (hN : N ⭢ₛ N') (x : Var) (lc_N : LC N) (lc_N' : LC N') :
    (M[x := N]) ⭢ₛ (M'[x := N'])

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma Standard.subst (hM : M ⭢ₛ M') (hN : N ⭢ₛ N') (x : Var) (lc_N : LC N) (lc_N' : LC N') :    (M[x := N]) ⭢ₛ (M'[x := N']) := by  induction hM generalizing N N'  case fvar =>    simp only [Term.subst_fvar]    split    · exact hN    · exact fvar _  case app ihL ihM => exact app (ihL hN lc_N lc_N') (ihM hN lc_N lc_N')  case abs m m' _ _ ih =>    apply abs <| free_union [fv] Var    grind  case rdx n m' _ lc_m lc_n cbn_m std_p ih =>    rw [Term.subst_app]    have std_p_subst := ih hN lc_N lc_N'    rw [Term.subst_open x N n m' lc_N] at std_p_subst    exact rdx (subst_lc lc_m lc_N) (subst_lc lc_n lc_N) (CBN.steps_subst x cbn_m lc_N) std_p_subst
Project
Lean Computer Science Library
License
Apache-2.0
Commit
f36649cff2c9
Source
Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/StandardReduction.lean:97-113

Reuse this declaration

Bring the exact result into your workflow

The import identifies the source module. Your project still needs the pinned package dependency shown on this page.

What this badge means

This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.

Continue in this project

Related declarations

Project-declaredLean 4.33.0-rc1

Unique minimal

Cslib.Automata.DA.FinAcc.unique_minimal

Plain-language statement

The minimal DFA M accepting the language l is unique up to unique isomorphism.

computer sciencecomputabilityprogram semantics

Source project: Lean Computer Science Library

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Buchi Family cover

Cslib.Automata.NA.Buchi.buchiFamily_cover

Project documentation

na.buchiFamily is a cover if na has only finitely many states. This theorem uses the Ramsey theorem for infinite graphs and does not depend on any details of na.BuchiCongruence other than that it is of finite index.

computer sciencecomputabilityprogram semantics

Source project: Lean Computer Science Library

Person-level attribution pending.

View proof record