AFTD Auto-Formalizing Theoretical Domains

Cslib.FreeM.bind_pure_comp

theoremverifiedformalizationimported Lean

Cslib.FreeM.bind_pure_comp

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
@[simp]
lemma Cslib.FreeM.bind_pure_comp (f : α → β) : ∀ x : FreeM F α, x.bind (pure ∘ f) = map f x
Formalizes
CSLib, `Cslib.FreeM.bind_pure_comp`
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 9
Used by 75

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''} in@[simp]lemma Cslib.FreeM.bind_pure_comp (f : α → β) : ∀ x : FreeM F α, x.bind (pure ∘ f) = map f x  | .pure a => rfl  | liftBind op k => by simp only [FreeM.bind, map, bind_pure_comp]
See it in the graphDiscuss this resultChallenge it