AFTD Auto-Formalizing Theoretical Domains

Cslib.FreeM.Interprets.eq

theoremverifiedformalizationimported Lean

Cslib.FreeM.Interprets.eq

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u v w w' w'' in
variable {F : Type u → Type v} {ι : Type u} {α : Type w} {β : Type w'} {γ : Type w''} in
variable {m : Type u → Type w} [Monad m] {α β : Type u} in
theorem Cslib.FreeM.Interprets.eq {handler : {ι : Type u} → F ι → m ι} {interp : FreeM F α → m α}
    (h : Interprets handler interp) :
    interp = (·.liftM @handler)
Formalizes
CSLib, `Cslib.FreeM.Interprets.eq`
Lean proof
By Tanner Duve, Eric Wieser, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2025 Tanner Duve. 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 32
Used by 5

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inuniverse u v w w' w'' invariable {F : Type u → Type v} {ι : Type u} {α : Type w} {β : Type w'} {γ : Type w''} invariable {m : Type u → Type w} [Monad m] {α β : Type u} intheorem Cslib.FreeM.Interprets.eq {handler : {ι : Type u} → F ι → m ι} {interp : FreeM F α → m α}    (h : Interprets handler interp) :    interp = (·.liftM @handler) := by  ext x  induction x with  | pure a => exact h.apply_pure a  | lift_bind op cont ih =>    simp [h.apply_lift_bind, ih]
See it in the graphDiscuss this resultChallenge it