PFunctor.FreeM.liftM_lift_bind
theoremverifiedformalizationimported Lean
PFunctor.FreeM.liftM_lift_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 @[simp] lemma PFunctor.FreeM.liftM_lift_bind (a : P.A) (cont : P.B a → P.FreeM α) : FreeM.liftM interp (FreeM.lift a >>= cont) = (do let u ← interp a; (cont u).liftM interp)
- Formalizes
- CSLib, `PFunctor.FreeM.liftM_lift_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_lift_bind← PFunctor.FreeM.liftM_lift_bind (Cslib/Foundations/Data/PFunctor/Free.lean:279): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 13
- PFunctor.FreeM.bind_eq_bindNote that this lemma does not always apply, as it is universe-constrained by
Bind.bind. - Cslib.FreeM.liftM_lift_bindCslib.FreeM.liftM_lift_bind
- 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.liftBind_bindPFunctor.FreeM.liftBind_bind
- 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. - PFunctor.FreeM.instPurePFunctor.FreeM.instPure
- PFunctor.FreeM.bind_pure_compPFunctor.FreeM.bind_pure_comp
- PFunctor.FreeM.instBindPFunctor.FreeM.instBind
- PFunctor.FreeM.bind_eq_bindNote that this lemma does not always apply, as it is universe-constrained by
- Used by 11
- PFunctor.FreeM.liftM_seqLeftPFunctor.FreeM.liftM_seqLeft
- PFunctor.FreeM.Interprets.liftMPFunctor.FreeM.Interprets.liftM
- PFunctor.FreeM.liftM_seqPFunctor.FreeM.liftM_seq
- PFunctor.FreeM.liftM_liftPFunctor.FreeM.liftM_lift
- PFunctor.FreeM.Interprets.eqPFunctor.FreeM.Interprets.eq
- PFunctor.FreeM.liftM_seqRightPFunctor.FreeM.liftM_seqRight
- PFunctor.FreeM.liftM_bindPFunctor.FreeM.liftM_bind
- PFunctor.FreeM.InterpretsA predicate stating that
eval : P.FreeM α → m αis an interpreter for the polynomial effect handlerhandler : (a : P.A) → m (P.B a).… - PFunctor.FreeM.liftM_liftObjPFunctor.FreeM.liftM_liftObj
- PFunctor.FreeM.liftM_mapPFunctor.FreeM.liftM_map
- PFunctor.FreeM.Interprets.iffThe universal property of the free monad
P.FreeM. That is,liftM handleris the unique interpreter that extends the effect handler…
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)) in@[simp]lemma PFunctor.FreeM.liftM_lift_bind (a : P.A) (cont : P.B a → P.FreeM α) : FreeM.liftM interp (FreeM.lift a >>= cont) = (do let u ← interp a; (cont u).liftM interp) := by dsimp only [FreeM.liftM, FreeM.bind, FreeM.lift] rfl