PFunctor.FreeM.liftM_liftObj
theoremverifiedformalizationimported Lean
PFunctor.FreeM.liftM_liftObj
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_liftObj (interp : (a : P.A) → m (P.B a)) (x : P.Obj α) : (FreeM.liftObj x).liftM interp = x.2 <$> interp x.1
- Formalizes
- CSLib, `PFunctor.FreeM.liftM_liftObj`
- 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_liftObj← PFunctor.FreeM.liftM_liftObj (Cslib/Foundations/Data/PFunctor/Free.lean:369): verbatim
- Verified
- 08 Oct 2026
- Axioms
Quot.soundpropext- Built on 30
- PFunctor.FreeM.liftM_liftPFunctor.FreeM.liftM_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.liftObjLift an object of the base polynomial functor into the free monad. This lifts the shape
x.1withliftand relabels the responses with… - PFunctor.FreeMThe free monad on a polynomial functor. This extends
WTypewith an extrapureconstructor. - PFunctor.FreeM.instFunctorPFunctor.FreeM.instFunctor
- PFunctor.FreeM.liftLift a shape of the base polynomial functor into the free monad.
- PFunctor.FreeM.liftM_mapPFunctor.FreeM.liftM_map
- PFunctor.FreeM.pure_eq_purePFunctor.FreeM.pure_eq_pure
- PFunctor.FreeM.lift_ne_purePFunctor.FreeM.lift_ne_pure
- PFunctor.FreeM.pure_ne_liftPFunctor.FreeM.pure_ne_lift
- PFunctor.FreeM.bind_eq_bindNote that this lemma does not always apply, as it is universe-constrained by
Bind.bind. - PFunctor.FreeM.map_eq_mapNote that this lemma does not always apply, as it is universe-constrained by
Functor.map. - PFunctor.FreeM.liftBind_eqPFunctor.FreeM.liftBind_eq
- PFunctor.FreeM.liftObj_ne_purePFunctor.FreeM.liftObj_ne_pure
- PFunctor.FreeM.pure_ne_liftObjPFunctor.FreeM.pure_ne_liftObj
- PFunctor.FreeM.pure_bind
.pure afollowed bybindcollapses immediately. - PFunctor.FreeM.bind_purePFunctor.FreeM.bind_pure
- PFunctor.FreeM.bind_pure_compPFunctor.FreeM.bind_pure_comp
- PFunctor.FreeM.liftBind_bindPFunctor.FreeM.liftBind_bind
- PFunctor.FreeM.liftObj_bindPFunctor.FreeM.liftObj_bind
- PFunctor.FreeM.bind_eq_pure_iffPFunctor.FreeM.bind_eq_pure_iff
- PFunctor.FreeM.pure_eq_bind_iffPFunctor.FreeM.pure_eq_bind_iff
- PFunctor.FreeM.id_mapPFunctor.FreeM.id_map
- PFunctor.FreeM.pure_injPFunctor.FreeM.pure_inj
- PFunctor.FreeM.liftM_purePFunctor.FreeM.liftM_pure
- PFunctor.FreeM.liftM_lift_bindPFunctor.FreeM.liftM_lift_bind
- PFunctor.FreeM.liftM_bindPFunctor.FreeM.liftM_bind
- PFunctor.FreeM.liftM_seqPFunctor.FreeM.liftM_seq
- PFunctor.FreeM.liftM_seqLeftPFunctor.FreeM.liftM_seqLeft
- PFunctor.FreeM.liftM_seqRightPFunctor.FreeM.liftM_seqRight
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_liftObj (interp : (a : P.A) → m (P.B a)) (x : P.Obj α) : (FreeM.liftObj x).liftM interp = x.2 <$> interp x.1 := by simp [liftObj]