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

Soundness

Cslib.LambdaCalculus.LocallyNameless.Stlc.soundness

Project documentation

The soundness lemma states that if a term t has type τ in context Γ, then t is semantically valid with respect to Γ and τ

Exact Lean statement

lemma soundness {Γ : Context Var (Ty Base)} (derivation_t : Γ ⊢ t ∶ τ) : entails Γ t τ

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma soundness {Γ : Context Var (Ty Base)} (derivation_t : Γ  t ∶ τ) : entails Γ t τ := by  induction derivation_t with  | var Γ xσ_mem_Γ => grind  | @abs σ Γ t τ L HL IH =>    intro E _ _ s    have sat_semMap_σ := semanticMap_saturated (Var := Var) σ    have sat_semMap_τ := semanticMap_saturated (Var := Var) τ    have := sat_semMap_τ.multiApp (multiSubst E t) s []    let := multiSubst E t    have x, _ := fresh_exists <| E.dom ∪ free_union [fv, Context.dom, Env.fv] Var    have := IH (x := x) (E := x,s :: E)    grind [multiSubst_abs, entailsContext_cons, multiSubst_open_var]  | app => grind [multiSubst_app]
Project
Lean Computer Science Library
License
Apache-2.0
Commit
f36649cff2c9
Source
Cslib/Languages/LambdaCalculus/LocallyNameless/Stlc/StrongNorm.lean:104-116

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