AFTD Auto-Formalizing Theoretical Domains

Cslib.FreeM.liftM_bind

theoremverifiedformalizationimported Lean

Cslib.FreeM.liftM_bind

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
variable {m : Type u → Type w} [Monad m] {α β : Type u} in
@[simp]
lemma Cslib.FreeM.liftM_bind [LawfulMonad m]
    (interp : {ι : Type u} → F ι → m ι) (x : FreeM F α) (f : α → FreeM F β) :
    (x >>= f).liftM interp = (do let a ← x.liftM interp; (f a).liftM interp)
Formalizes
CSLib, `Cslib.FreeM.liftM_bind`
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 26
Used by 65

Lean source view module on GitHub

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
variable {m : Type u → Type w} [Monad m] {α β : Type u} in
@[simp]
lemma Cslib.FreeM.liftM_bind [LawfulMonad m]
    (interp : {ι : Type u} → F ι → m ι) (x : FreeM F α) (f : α → FreeM F β) :
    (x >>= f).liftM interp = (do let a ← x.liftM interp; (f a).liftM interp) := by
  induction x generalizing f with
  | pure a => simp only [liftM_pure, LawfulMonad.pure_bind]
  | lift_bind op cont ih => simp [← ih]
See it in the graphDiscuss this resultChallenge it