Cslib.FreeM.bind_assoc
theoremverifiedformalizationimported Lean
Cslib.FreeM.bind_assoc
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in universe u v w w' w'' in variable {F : Type u → Type v} {ι : Type u} {α : Type w} {β : Type w'} {γ : Type w''} in protected theorem Cslib.FreeM.bind_assoc (x : FreeM F α) (f : α → FreeM F β) (g : β → FreeM F γ) : (x.bind f).bind g = x.bind (fun x => (f x).bind g)
- Formalizes
- CSLib, `Cslib.FreeM.bind_assoc`
- Lean proof
- By Tanner Duve, Eric Wieser, 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.bind_assoc← Cslib.FreeM.bind_assoc (Cslib/Foundations/Control/Monad/Free.lean:158): verbatim
- Verified
- 08 Oct 2026
- Axioms
Quot.soundpropext- Built on 10
- Cslib.FreeM.instFunctorCslib.FreeM.instFunctor
- Cslib.FreeM.liftBind_eqCslib.FreeM.liftBind_eq
- Cslib.FreeM.bind_eq_bindNote that this lemma does not always apply, as it is universe-constrained by
Bind.bind. - Cslib.FreeM.instBindCslib.FreeM.instBind
- Cslib.FreeM.inductionAn override for the default induction principle that is in simp-normal form. Note that when
αandιare in the same universe, this… - Cslib.FreeM.bindBind operation for the
FreeMmonad. The builtin>>=notation should be preferred whenαandβare in the same universe. - Cslib.FreeM.instPureCslib.FreeM.instPure
- Cslib.FreeM.liftLift an operation from the effect signature
Finto theFreeM Fmonad. - 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.bind_pureCslib.FreeM.bind_pure
- Used by 9
- Cslib.FreeM.FreeCont.run_bindCslib.FreeM.FreeCont.run_bind
- PFunctor.FreeM.instLawfulMonadPFunctor.FreeM.instLawfulMonad
- PFunctor.FreeM.liftBind_bindPFunctor.FreeM.liftBind_bind
- Cslib.FreeM.FreeWriter.run_bindCslib.FreeM.FreeWriter.run_bind
- Cslib.FreeM.map_bindCslib.FreeM.map_bind
- Cslib.FreeM.FreeState.run_bindCslib.FreeM.FreeState.run_bind
- PFunctor.FreeM.liftM_bindPFunctor.FreeM.liftM_bind
- Cslib.FreeM.instLawfulMonadCslib.FreeM.instLawfulMonad
- PFunctor.FreeM.bind_assocPFunctor.FreeM.bind_assoc
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 inuniverse u v w w' w'' invariable {F : Type u → Type v} {ι : Type u} {α : Type w} {β : Type w'} {γ : Type w''} inprotected theorem Cslib.FreeM.bind_assoc (x : FreeM F α) (f : α → FreeM F β) (g : β → FreeM F γ) : (x.bind f).bind g = x.bind (fun x => (f x).bind g) := by induction x with | pure a => rfl | lift_bind op cont ih => simp [← liftBind_eq, FreeM.bind, ih] at *