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.PFunctor.FreeM.liftM_bind← PFunctor.FreeM.liftM_bind (Cslib/Foundations/Data/PFunctor/Free.lean:327): verbatim
- Verified
- 08 Oct 2026
- Axioms
Quot.soundpropext- Built on 20
- PFunctor.FreeM.bind_eq_bindNote that this lemma does not always apply, as it is universe-constrained by
Bind.bind. - PFunctor.FreeM.instLawfulMonadPFunctor.FreeM.instLawfulMonad
- PFunctor.FreeM.pure_ne_liftPFunctor.FreeM.pure_ne_lift
- PFunctor.FreeM.liftMInterpret a
FreeM Pcomputation into any monadmby providing an interpretationinterp : (a : P.A) → m (P.B a)for each operation. - PFunctor.FreeM.instMonadPFunctor.FreeM.instMonad
- PFunctor.FreeM.liftBind_bindPFunctor.FreeM.liftBind_bind
- Cslib.FreeM.pure_bind
.pure afollowed bybindcollapses immediately. - PFunctor.FreeM.liftLift a shape of the base polynomial functor into the free monad.
- PFunctor.FreeM.liftBind_eqPFunctor.FreeM.liftBind_eq
- PFunctor.FreeM.bind_purePFunctor.FreeM.bind_pure
- PFunctor.FreeM.lift_ne_purePFunctor.FreeM.lift_ne_pure
- PFunctor.FreeMThe free monad on a polynomial functor. This extends
WTypewith an extrapureconstructor. - Cslib.FreeM.bind_assocCslib.FreeM.bind_assoc
- PFunctor.FreeM.instPurePFunctor.FreeM.instPure
- PFunctor.FreeM.bind_pure_compPFunctor.FreeM.bind_pure_comp
- PFunctor.FreeM.instBindPFunctor.FreeM.instBind
- PFunctor.FreeM.liftM_lift_bindPFunctor.FreeM.liftM_lift_bind
- PFunctor.FreeM.bindBind operation for the
FreeMmonad. The builtin>>=notation should be preferred whenαandβare in the same universe. - PFunctor.FreeM.inductionAn override for the default induction principle that is in simp-normal form. Note that when
αandP.B aare in the same universe, this… - PFunctor.FreeM.liftM_purePFunctor.FreeM.liftM_pure
- PFunctor.FreeM.bind_eq_bindNote that this lemma does not always apply, as it is universe-constrained by
- Used by 7
- PFunctor.FreeM.liftM_seqLeftPFunctor.FreeM.liftM_seqLeft
- Cslib.FreeM.liftM_bindCslib.FreeM.liftM_bind
- PFunctor.FreeM.liftM_seqPFunctor.FreeM.liftM_seq
- PFunctor.FreeM.liftM_liftPFunctor.FreeM.liftM_lift
- PFunctor.FreeM.liftM_seqRightPFunctor.FreeM.liftM_seqRight
- PFunctor.FreeM.liftM_liftObjPFunctor.FreeM.liftM_liftObj
- PFunctor.FreeM.liftM_mapPFunctor.FreeM.liftM_map
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 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