AFTD Auto-Formalizing Theoretical Domains

Cslib.FreeM.liftM_map

theoremverifiedformalizationimported Lean

Cslib.FreeM.liftM_map

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
@[simp]
lemma Cslib.FreeM.liftM_map [LawfulMonad m]
    (interp : {ι : Type u} → F ι → m ι) (f : α → β) (x : FreeM F α) :
    (f <$> x).liftM interp = f <$> x.liftM interp
Formalizes
CSLib, `Cslib.FreeM.liftM_map`
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 24
Used by 64

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} in@[simp]lemma Cslib.FreeM.liftM_map [LawfulMonad m]    (interp : {ι : Type u} → F ι → m ι) (f : α → β) (x : FreeM F α) :    (f <$> x).liftM interp = f <$> x.liftM interp := by  simp_rw [← LawfulMonad.bind_pure_comp, liftM_bind, liftM_pure]
See it in the graphDiscuss this resultChallenge it