AFTD Auto-Formalizing Theoretical Domains

Cslib.FreeM.FreeReader.run_bind

theoremverifiedformalizationimported Lean

Cslib.FreeM.FreeReader.run_bind

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]
lemma Cslib.FreeM.FreeReader.run_bind (x : FreeReader σ α) (f : α → FreeReader σ β) (s₀ : σ) :
    run (x >>= f) s₀ = run (f <| run x s₀) s₀
Formalizes
CSLib, `Cslib.FreeM.FreeReader.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 50
Used by 2

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@[simp]lemma Cslib.FreeM.FreeReader.run_bind (x : FreeReader σ α) (f : α → FreeReader σ β) (s₀ : σ) :    run (x >>= f) s₀ = run (f <| run x s₀) s₀ := by  rw [← Id.run_pure (run _ _), ← run_toReaderM, toReaderM, liftM_bind, ReaderT.run_bind,    Id.run_bind, run_toReaderM, run_toReaderM, Id.run_pure, Id.run_pure]
See it in the graphDiscuss this resultChallenge it