AFTD Auto-Formalizing Theoretical Domains

PFunctor.FreeM.liftM_bind

theoremverifiedformalizationimported Lean

PFunctor.FreeM.liftM_bind

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u v uA uB in
variable {P : PFunctor.{uA, uB}} {α β γ : Type*} in
variable {m : Type uB → Type v} {α : Type uB} in
variable [Monad m] (interp : (a : P.A) → m (P.B a)) in
variable [LawfulMonad m] in
@[simp]
lemma PFunctor.FreeM.liftM_bind {α β : Type uB} (x : P.FreeM α) (f : α → P.FreeM β) :
    (x >>= f).liftM interp = (do let u ← x.liftM interp; (f u).liftM interp)
Formalizes
CSLib, `PFunctor.FreeM.liftM_bind`
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 20
Used by 7

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*} invariable {m : Type uB → Type v} {α : Type uB} invariable [Monad m] (interp : (a : P.A) → m (P.B a)) invariable [LawfulMonad m] in@[simp]lemma PFunctor.FreeM.liftM_bind {α β : Type uB} (x : P.FreeM α) (f : α → P.FreeM β) :    (x >>= f).liftM interp = (do let u ← x.liftM interp; (f u).liftM interp) := by  induction x with  | pure _ => simp only [liftM_pure, LawfulMonad.pure_bind]  | lift_bind a cont h =>    simp_rw [bind_eq_bind]    rw [LawfulMonad.bind_assoc, liftM_lift_bind]    simp_rw [liftM_lift_bind, LawfulMonad.bind_assoc]    congr 1    funext u    exact h u
See it in the graphDiscuss this resultChallenge it