AFTD Auto-Formalizing Theoretical Domains

Cslib.FreeM.FreeState.run_toStateM

theoremverifiedformalizationimported Lean

The canonical interpreter toStateM derived from liftM agrees with the hand-written recursive interpreter run for FreeState.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u v w w' w'' in
variable {σ : Type u} {α : Type v} in
@[simp]
theorem Cslib.FreeM.FreeState.run_toStateM {α : Type u} (comp : FreeState σ α) (s₀ : σ) :
    (toStateM comp).run s₀ = pure (run comp s₀)
Formalizes
CSLib, `Cslib.FreeM.FreeState.run_toStateM`
Lean proof
By Tanner Duve, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2025 Tanner Duve. 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.
Verified
08 Oct 2026
Axioms
none — Lean reports it depends on no axioms
Built on 33
Used by 33

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inuniverse u v w w' w'' invariable {σ : Type u} {α : Type v} in/-- The canonical interpreter `toStateM` derived from `liftM` agrees with the hand-written recursive interpreter `run` for `FreeState`. -/@[simp]theorem Cslib.FreeM.FreeState.run_toStateM {α : Type u} (comp : FreeState σ α) (s₀ : σ) :    (toStateM comp).run s₀ = pure (run comp s₀) := by  induction comp generalizing s₀ with  | pure a => rfl  | liftBind op cont ih =>    cases op <;> apply ih
See it in the graphDiscuss this resultChallenge it