PFunctor.FreeM.Interprets.eq
theoremverifiedformalizationimported Lean
PFunctor.FreeM.Interprets.eq
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 theorem PFunctor.FreeM.Interprets.eq {handler : (a : P.A) → m (P.B a)} {eval : P.FreeM α → m α} (h : Interprets handler eval) : eval = (·.liftM handler)
- Formalizes
- CSLib, `PFunctor.FreeM.Interprets.eq`
- 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.Interprets.eq← PFunctor.FreeM.Interprets.eq (Cslib/Foundations/Data/PFunctor/Free.lean:298): verbatim
- Verified
- 08 Oct 2026
- Axioms
Quot.soundpropext- Built on 15
- PFunctor.FreeM.bind_eq_bindNote that this lemma does not always apply, as it is universe-constrained by
Bind.bind. - PFunctor.FreeM.pure_ne_liftPFunctor.FreeM.pure_ne_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.liftBind_bindPFunctor.FreeM.liftBind_bind
- PFunctor.FreeM.liftLift a shape of the base polynomial functor into the free monad.
- PFunctor.FreeM.liftBind_eqPFunctor.FreeM.liftBind_eq
- PFunctor.FreeM.bind_purePFunctor.FreeM.bind_pure
- PFunctor.FreeM.lift_ne_purePFunctor.FreeM.lift_ne_pure
- PFunctor.FreeMThe free monad on a polynomial functor. This extends
WTypewith an extrapureconstructor. - 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.bind_pure_compPFunctor.FreeM.bind_pure_comp
- PFunctor.FreeM.instBindPFunctor.FreeM.instBind
- PFunctor.FreeM.liftM_lift_bindPFunctor.FreeM.liftM_lift_bind
- PFunctor.FreeM.bindBind operation for the
FreeMmonad. The builtin>>=notation should be preferred whenαandβare in the same universe. - PFunctor.FreeM.inductionAn override for the default induction principle that is in simp-normal form. Note that when
αandP.B aare in the same universe, this…
- PFunctor.FreeM.bind_eq_bindNote that this lemma does not always apply, as it is universe-constrained by
- Used by 7
- Cslib.FreeM.FreeCont.toContT_unique
toContTis the unique interpreter extendingcontInterp. - Cslib.FreeM.Interprets.eqCslib.FreeM.Interprets.eq
- Cslib.FreeM.FreeState.toStateM_unique
toStateMis the unique interpreter extendingstateInterp. - Cslib.FreeM.FreeReader.toReaderM_unique
toReaderMis the unique interpreter extendingreadInterp. - Cslib.FreeM.Interprets.iffThe universal property of the free monad
FreeM. That is,liftM handleris the unique interpreter that extends the effect handler… - PFunctor.FreeM.Interprets.iffThe universal property of the free monad
P.FreeM. That is,liftM handleris the unique interpreter that extends the effect handler… - Cslib.FreeM.FreeWriter.toWriterT_unique
toWriterTis the unique interpreter extendingwriterInterp.
- Cslib.FreeM.FreeCont.toContT_unique
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)) intheorem PFunctor.FreeM.Interprets.eq {handler : (a : P.A) → m (P.B a)} {eval : P.FreeM α → m α} (h : Interprets handler eval) : eval = (·.liftM handler) := by ext x induction x with | pure a => exact h.apply_pure a | lift_bind a cont ih => rw [h.apply_lift_bind] conv_rhs => simp only [bind_eq_bind, liftM_lift_bind] simp only [ih]