AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
Quot.soundpropext
Built on 10
Used by 9

Lean source view module on GitHub

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 *
See it in the graphDiscuss this resultChallenge it