AFTD Auto-Formalizing Theoretical Domains

Cslib.FreeM.FreeState.run_bind

theoremverifiedformalizationimported Lean

Cslib.FreeM.FreeState.run_bind

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]
lemma Cslib.FreeM.FreeState.run_bind (x : FreeState σ α) (f : α → FreeState σ β) (s₀ : σ) :
    run (x.bind f) s₀ = let p := x.run s₀; (f p.1).run p.2
Formalizes
CSLib, `Cslib.FreeM.FreeState.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 41
Used by 29

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