AFTD Auto-Formalizing Theoretical Domains

PFunctor.FreeM.bind_assoc

theoremverifiedformalizationimported Lean

PFunctor.FreeM.bind_assoc

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u v uA uB in
variable {P : PFunctor.{uA, uB}} {α β γ : Type*} in
protected theorem PFunctor.FreeM.bind_assoc (x : P.FreeM α) (f : α → P.FreeM β) (g : β → P.FreeM γ) :
    (x.bind f).bind g = x.bind (fun a => (f a).bind g)
Formalizes
CSLib, `PFunctor.FreeM.bind_assoc`
Lean proof
By Quang Dao, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Quang Dao. 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 11
Used by 5

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inuniverse u v uA uB invariable {P : PFunctor.{uA, uB}} {α β γ : Type*} inprotected theorem PFunctor.FreeM.bind_assoc (x : P.FreeM α) (f : α → P.FreeM β) (g : β → P.FreeM γ) :    (x.bind f).bind g = x.bind (fun a => (f a).bind g) := by  induction x with  | pure a => rfl  | lift_bind a cont ih => simp [← liftBind_eq, FreeM.bind, ih] at *
See it in the graphDiscuss this resultChallenge it