AFTD Auto-Formalizing Theoretical Domains

Cslib.FreeM.FreeWriter.run_bind

theoremverifiedformalizationimported Lean

Cslib.FreeM.FreeWriter.run_bind

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]
lemma Cslib.FreeM.FreeWriter.run_bind [Monoid ω] (x : FreeWriter ω α) (f : α → FreeWriter ω β) :
    run (x.bind f) = let p := run x; ((f p.1).run.1, p.2 * (f p.1).run.2)
Formalizes
CSLib, `Cslib.FreeM.FreeWriter.run_bind`
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 45
Used by 20

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@[simp]lemma Cslib.FreeM.FreeWriter.run_bind [Monoid ω] (x : FreeWriter ω α) (f : α → FreeWriter ω β) :    run (x.bind f) = let p := run x; ((f p.1).run.1, p.2 * (f p.1).run.2) := by  induction x using FreeM.induction generalizing f with  | pure => simp  | lift_bind op cont ih =>    simp_rw [FreeM.bind_assoc]    cases op    simp [← liftBind_eq, run, ih, mul_assoc]
See it in the graphDiscuss this resultChallenge it