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.Cslib.FreeM.FreeReader.run_bind← Cslib.FreeM.FreeReader.run_bind (Cslib/Foundations/Control/Monad/Free/Effects.lean:433): verbatim
- Verified
- 08 Oct 2026
- Axioms
Quot.soundpropext- Built on 50
- Cslib.FreeM.FreeCont.run_bindCslib.FreeM.FreeCont.run_bind
- Cslib.FreeM.liftM_seqLeftCslib.FreeM.liftM_seqLeft
- Cslib.FreeM.liftM_bindCslib.FreeM.liftM_bind
- Cslib.FreeM.FreeState.run_pureCslib.FreeM.FreeState.run_pure
- Cslib.FreeM.FreeReader.run_pureCslib.FreeM.FreeReader.run_pure
- Cslib.FreeM.FreeWriter.run_lift_tellCslib.FreeM.FreeWriter.run_lift_tell
- Cslib.FreeM.FreeWriter.run_bindCslib.FreeM.FreeWriter.run_bind
- Cslib.FreeM.FreeReader.runRun a reader computation
- Cslib.FreeM.FreeWriter.run_pureCslib.FreeM.FreeWriter.run_pure
- Cslib.FreeM.liftM_seqRightCslib.FreeM.liftM_seqRight
- Cslib.FreeM.FreeCont.run_pureCslib.FreeM.FreeCont.run_pure
- Cslib.FreeM.FreeState.run_bindCslib.FreeM.FreeState.run_bind
- Cslib.FreeM.liftM_liftCslib.FreeM.liftM_lift
- Cslib.FreeM.FreeReader.toReaderMConvert a
FreeReadercomputation into aReaderMcomputation. This is the canonical interpreter derived fromliftM. - Cslib.FreeM.FreeState.run_setCslib.FreeM.FreeState.run_set
- Cslib.FreeM.FreeCont.run_toContTThe canonical interpreter
toContTderived fromliftMagrees with the hand-written recursive interpreterrunforFreeCont. - Cslib.FreeM.FreeCont.run_callCC
runof acallCCnode simplifies to running the handler with the current continuation. - Cslib.FreeM.FreeReader.run_readCslib.FreeM.FreeReader.run_read
- Cslib.FreeM.FreeState.run_toStateMThe canonical interpreter
toStateMderived fromliftMagrees with the hand-written recursive interpreterrunforFreeState. - Cslib.FreeM.liftM_seqCslib.FreeM.liftM_seq
- Cslib.FreeM.liftM_mapCslib.FreeM.liftM_map
- Cslib.FreeM.FreeState.run_getCslib.FreeM.FreeState.run_get
- Cslib.FreeM.FreeCont.run_lift_callCCCslib.FreeM.FreeCont.run_lift_callCC
- Cslib.FreeM.FreeReader.run_toReaderMThe canonical interpreter
toReaderMderived fromliftMagrees with the hand-written recursive interpreterrunforFreeReader - Cslib.FreeM.FreeReader.instMonadReaderOfCslib.FreeM.FreeReader.instMonadReaderOf
- Cslib.FreeM.FreeReader.instMonadReaderCslib.FreeM.FreeReader.instMonadReader
- Cslib.FreeM.FreeWriter.run_toWriterTThe canonical interpreter
toWriterTderived fromliftMagrees with the hand-written recursive interpreterrunforFreeWriter. - Cslib.FreeM.FreeReaderReader monad via the
FreeMmonad - Cslib.FreeM.instBindCslib.FreeM.instBind
- Cslib.FreeM.ReaderFType constructor for reader operations.
- Cslib.FreeM.liftMInterpret a
FreeM Fcomputation into any monadmby providing an interpretation function for the effect signatureF. This function… - Cslib.FreeM.FreeReader.readInterpInterpret
ReaderFoperations intoReaderM. - Cslib.FreeMThe Free monad over a type constructor
F. AFreeM F ais a tree of operations from the type constructorF, with leaves of typea.… - Cslib.FreeM.pure_eq_pureCslib.FreeM.pure_eq_pure
- Cslib.FreeM.bind_eq_bindNote that this lemma does not always apply, as it is universe-constrained by
Bind.bind. - Cslib.FreeM.map_eq_mapNote that this lemma does not always apply, as it is universe-constrained by
Functor.map. - Cslib.FreeM.liftBind_eqCslib.FreeM.liftBind_eq
- Cslib.FreeM.pure_bind
.pure afollowed bybindcollapses immediately. - Cslib.FreeM.bind_pureCslib.FreeM.bind_pure
- Cslib.FreeM.bind_pure_compCslib.FreeM.bind_pure_comp
- Cslib.FreeM.map_pureCslib.FreeM.map_pure
- Cslib.FreeM.map_bindCslib.FreeM.map_bind
- Cslib.FreeM.id_mapCslib.FreeM.id_map
- Cslib.FreeM.liftM_pureCslib.FreeM.liftM_pure
- Cslib.FreeM.liftM_lift_bindCslib.FreeM.liftM_lift_bind
- Cslib.FreeM.instPureCslib.FreeM.instPure
- Cslib.FreeM.instFunctorCslib.FreeM.instFunctor
- Cslib.FreeM.instLawfulFunctorCslib.FreeM.instLawfulFunctor
- Cslib.FreeM.instMonadCslib.FreeM.instMonad
- Cslib.FreeM.instLawfulMonadCslib.FreeM.instLawfulMonad
- Used by 2
- Cslib.FreeM.FreeReader.run_withReaderCslib.FreeM.FreeReader.run_withReader
- Cslib.FreeM.FreeReader.instMonadWithReaderOfCslib.FreeM.FreeReader.instMonadWithReaderOf
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
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]