AFTD Auto-Formalizing Theoretical Domains

Cslib.FreeM.FreeReader.run_toReaderM

theoremverifiedformalizationimported Lean

The canonical interpreter toReaderM derived from liftM agrees with the hand-written recursive interpreter run for FreeReader

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.FreeM Cslib.FreeM.FreeReader in
universe u v w w' w'' in
variable {σ : Type u} {α : Type u} in
@[simp]
theorem Cslib.FreeM.FreeReader.run_toReaderM {α : Type u} (comp : FreeReader σ α) (s : σ) :
    (toReaderM comp).run s = pure (run comp s)
Formalizes
CSLib, `Cslib.FreeM.FreeReader.run_toReaderM`
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 47
Used by 5

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Cslib Cslib.FreeM Cslib.FreeM.FreeReader inuniverse u v w w' w'' invariable {σ : Type u} {α : Type u} in/-- The canonical interpreter `toReaderM` derived from `liftM` agrees with the hand-written recursive interpreter `run` for `FreeReader` -/@[simp]theorem Cslib.FreeM.FreeReader.run_toReaderM {α : Type u} (comp : FreeReader σ α) (s : σ) :    (toReaderM 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