PFunctor.FreeM.liftM_map
theoremverifiedformalizationimported Lean
PFunctor.FreeM.liftM_map
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_map {α β : Type uB} (f : α → β) (x : P.FreeM α) : (f <$> x).liftM interp = f <$> x.liftM interp
- Formalizes
- CSLib, `PFunctor.FreeM.liftM_map`
- 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_map← PFunctor.FreeM.liftM_map (Cslib/Foundations/Data/PFunctor/Free.lean:340): verbatim
- Verified
- 08 Oct 2026
- Axioms
Quot.soundpropext- Built on 9
- PFunctor.FreeM.instLawfulMonadPFunctor.FreeM.instLawfulMonad
- 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.liftM_bindPFunctor.FreeM.liftM_bind
- PFunctor.FreeMThe free monad on a polynomial functor. This extends
WTypewith an extrapureconstructor. - PFunctor.FreeM.liftM_lift_bindPFunctor.FreeM.liftM_lift_bind
- Cslib.FreeM.bind_pure_compCslib.FreeM.bind_pure_comp
- PFunctor.FreeM.liftM_purePFunctor.FreeM.liftM_pure
- PFunctor.FreeM.instFunctorPFunctor.FreeM.instFunctor
- Used by 5
- PFunctor.FreeM.liftM_seqLeftPFunctor.FreeM.liftM_seqLeft
- PFunctor.FreeM.liftM_seqPFunctor.FreeM.liftM_seq
- PFunctor.FreeM.liftM_liftPFunctor.FreeM.liftM_lift
- Cslib.FreeM.liftM_mapCslib.FreeM.liftM_map
- PFunctor.FreeM.liftM_liftObjPFunctor.FreeM.liftM_liftObj
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_map {α β : Type uB} (f : α → β) (x : P.FreeM α) : (f <$> x).liftM interp = f <$> x.liftM interp := by simp_rw [← LawfulMonad.bind_pure_comp, liftM_bind, liftM_pure]