AFTD Auto-Formalizing Theoretical Domains

Cslib.FreeM.FreeWriter.run_toWriterT

theoremverifiedformalizationimported Lean

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

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.FreeM Cslib.FreeM.FreeWriter in
universe u v w w' w'' in
open WriterF in
variable {ω : Type u} {α β : Type*} in
@[simp]
theorem Cslib.FreeM.FreeWriter.run_toWriterT {α : Type u} [Monoid ω] (comp : FreeWriter ω α) :
    (toWriterT comp).run = pure (run comp)
Formalizes
CSLib, `Cslib.FreeM.FreeWriter.run_toWriterT`
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
Quot.soundpropext
Built on 46
Used by 19

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Cslib Cslib.FreeM Cslib.FreeM.FreeWriter inuniverse u v w w' w'' inopen WriterF invariable {ω : Type u} {α β : Type*} in/-- The canonical interpreter `toWriterT` derived from `liftM` agrees with the hand-written recursive interpreter `run` for `FreeWriter`. -/@[simp]theorem Cslib.FreeM.FreeWriter.run_toWriterT {α : Type u} [Monoid ω] (comp : FreeWriter ω α) :    (toWriterT comp).run = pure (run comp) := by  induction comp using FreeM.induction with  | pure _ => simp [toWriterT]  | lift_bind op cont ih =>    simp only [toWriterT, run_bind] at *    ext : 1    cases op    simp [ih]
See it in the graphDiscuss this resultChallenge it