PFunctor.FreeM.liftBind_eq
theoremverifiedformalizationimported Lean
PFunctor.FreeM.liftBind_eq
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in universe u v uA uB in variable {P : PFunctor.{uA, uB}} {α β γ : Type*} in @[simp] lemma PFunctor.FreeM.liftBind_eq (a : P.A) (cont : P.B a → P.FreeM α) : FreeM.liftBind a cont = (FreeM.lift a).bind cont
- Formalizes
- CSLib, `PFunctor.FreeM.liftBind_eq`
- 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.liftBind_eq← PFunctor.FreeM.liftBind_eq (Cslib/Foundations/Data/PFunctor/Free.lean:132): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 7
- PFunctor.FreeM.bind_eq_bindNote that this lemma does not always apply, as it is universe-constrained by
Bind.bind. - PFunctor.FreeM.pure_ne_liftPFunctor.FreeM.pure_ne_lift
- Cslib.FreeM.liftBind_eqCslib.FreeM.liftBind_eq
- PFunctor.FreeM.liftLift a shape of the base polynomial functor into the free monad.
- PFunctor.FreeM.lift_ne_purePFunctor.FreeM.lift_ne_pure
- PFunctor.FreeMThe free monad on a polynomial functor. This extends
WTypewith an extrapureconstructor. - PFunctor.FreeM.bindBind operation for the
FreeMmonad. The builtin>>=notation should be preferred whenαandβare in the same universe.
- PFunctor.FreeM.bind_eq_bindNote that this lemma does not always apply, as it is universe-constrained by
- Used by 16
- PFunctor.FreeM.Interprets.liftMPFunctor.FreeM.Interprets.liftM
- PFunctor.FreeM.liftObjLift an object of the base polynomial functor into the free monad. This lifts the shape
x.1withliftand relabels the responses with… - PFunctor.FreeM.liftObj_ne_purePFunctor.FreeM.liftObj_ne_pure
- PFunctor.FreeM.instMonadLiftObjPFunctor.FreeM.instMonadLiftObj
- PFunctor.FreeM.monadLift_eq_liftObjPFunctor.FreeM.monadLift_eq_liftObj
- PFunctor.FreeM.liftBind_bindPFunctor.FreeM.liftBind_bind
- PFunctor.FreeM.pure_ne_liftObjPFunctor.FreeM.pure_ne_liftObj
- PFunctor.FreeM.liftM_liftPFunctor.FreeM.liftM_lift
- PFunctor.FreeM.Interprets.eqPFunctor.FreeM.Interprets.eq
- 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_lift_bindPFunctor.FreeM.liftM_lift_bind
- PFunctor.FreeM.liftObj_bindPFunctor.FreeM.liftObj_bind
- PFunctor.FreeM.bind_assocPFunctor.FreeM.bind_assoc
- PFunctor.FreeM.liftM_liftObjPFunctor.FreeM.liftM_liftObj
- 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…
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in universe u v uA uB in variable {P : PFunctor.{uA, uB}} {α β γ : Type*} in @[simp] lemma PFunctor.FreeM.liftBind_eq (a : P.A) (cont : P.B a → P.FreeM α) : FreeM.liftBind a cont = (FreeM.lift a).bind cont := rfl