AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
Quot.soundpropext
Built on 15
Used by 7

Lean source view module on GitHub

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]
See it in the graphDiscuss this resultChallenge it