PFunctor.FreeM.bind_pure_comp
theoremverifiedformalizationimported Lean
PFunctor.FreeM.bind_pure_comp
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.bind_pure_comp (f : α → β) : ∀ x : P.FreeM α, x.bind (pure ∘ f) = map f x
- Formalizes
- CSLib, `PFunctor.FreeM.bind_pure_comp`
- 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.bind_pure_comp← PFunctor.FreeM.bind_pure_comp (Cslib/Foundations/Data/PFunctor/Free.lean:183): verbatim
- Verified
- 08 Oct 2026
- Axioms
Quot.soundpropext- Built on 8
- 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.bind_purePFunctor.FreeM.bind_pure
- PFunctor.FreeMThe free monad on a polynomial functor. This extends
WTypewith an extrapureconstructor. - PFunctor.FreeM.instPurePFunctor.FreeM.instPure
- PFunctor.FreeM.mapMap a function over a
FreeMcomputation. The builtin<$>notation should be preferred whenαandβare in the same universe. - PFunctor.FreeM.bindBind operation for the
FreeMmonad. The builtin>>=notation should be preferred whenαandβare in the same universe. - Cslib.FreeM.bind_pure_compCslib.FreeM.bind_pure_comp
- PFunctor.FreeM.bind_eq_bindNote that this lemma does not always apply, as it is universe-constrained by
- Used by 17
- PFunctor.FreeM.instLawfulMonadPFunctor.FreeM.instLawfulMonad
- PFunctor.FreeM.bind_eq_pure_iffPFunctor.FreeM.bind_eq_pure_iff
- PFunctor.FreeM.Interprets.liftMPFunctor.FreeM.Interprets.liftM
- PFunctor.FreeM.liftObj_ne_purePFunctor.FreeM.liftObj_ne_pure
- PFunctor.FreeM.id_mapPFunctor.FreeM.id_map
- 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.pure_eq_bind_iffPFunctor.FreeM.pure_eq_bind_iff
- Cslib.FreeM.liftM_mapCslib.FreeM.liftM_map
- PFunctor.FreeM.liftM_lift_bindPFunctor.FreeM.liftM_lift_bind
- PFunctor.FreeM.liftObj_bindPFunctor.FreeM.liftObj_bind
- PFunctor.FreeM.liftM_liftObjPFunctor.FreeM.liftM_liftObj
- PFunctor.FreeM.comp_mapPFunctor.FreeM.comp_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*} in@[simp]lemma PFunctor.FreeM.bind_pure_comp (f : α → β) : ∀ x : P.FreeM α, x.bind (pure ∘ f) = map f x | .pure a => rfl | .liftBind a cont => by simp only [FreeM.bind, map, bind_pure_comp]