PFunctor.FreeM.pure_bind
theoremverifiedformalizationimported Lean
.pure a followed by bind collapses immediately.
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.pure_bind (a : α) (f : α → P.FreeM β) : (pure a : P.FreeM α).bind f = f a
- Formalizes
- CSLib, `PFunctor.FreeM.pure_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.pure_bind← PFunctor.FreeM.pure_bind (Cslib/Foundations/Data/PFunctor/Free.lean:173): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 5
- PFunctor.FreeM.bind_eq_bindNote that this lemma does not always apply, as it is universe-constrained by
Bind.bind. - Cslib.FreeM.pure_bind
.pure afollowed bybindcollapses immediately. - PFunctor.FreeMThe free monad on a polynomial functor. This extends
WTypewith an extrapureconstructor. - PFunctor.FreeM.instPurePFunctor.FreeM.instPure
- 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 4
- PFunctor.FreeM.instLawfulMonadPFunctor.FreeM.instLawfulMonad
- Cslib.FreeM.liftM_bindCslib.FreeM.liftM_bind
- PFunctor.FreeM.liftM_liftPFunctor.FreeM.liftM_lift
- PFunctor.FreeM.liftM_liftObjPFunctor.FreeM.liftM_liftObj
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 /-- `.pure a` followed by `bind` collapses immediately. -/ @[simp] lemma PFunctor.FreeM.pure_bind (a : α) (f : α → P.FreeM β) : (pure a : P.FreeM α).bind f = f a := rfl