PFunctor.FreeM.pure_eq_pure
theoremverifiedformalizationimported Lean
PFunctor.FreeM.pure_eq_pure
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] theorem PFunctor.FreeM.pure_eq_pure : (FreeM.pure : α → P.FreeM α) = pure
- Formalizes
- CSLib, `PFunctor.FreeM.pure_eq_pure`
- 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_eq_pure← PFunctor.FreeM.pure_eq_pure (Cslib/Foundations/Data/PFunctor/Free.lean:91): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 3
- PFunctor.FreeMThe free monad on a polynomial functor. This extends
WTypewith an extrapureconstructor. - Cslib.FreeM.pure_eq_pureCslib.FreeM.pure_eq_pure
- PFunctor.FreeM.instPurePFunctor.FreeM.instPure
- PFunctor.FreeMThe free monad on a polynomial functor. This extends
- Used by 2
- 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 @[simp] theorem PFunctor.FreeM.pure_eq_pure : (FreeM.pure : α → P.FreeM α) = pure := rfl