AFTD Auto-Formalizing Theoretical Domains

PFunctor.FreeM.bind_pure_comp

theoremverifiedformalizationimported Lean

PFunctor.FreeM.bind_pure_comp

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u v uA uB in
variable {P : PFunctor.{uA, uB}} {α β γ : Type*} in
@[simp]
lemma PFunctor.FreeM.bind_pure_comp (f : α → β) : ∀ x : P.FreeM α, x.bind (pure ∘ f) = map f x
Formalizes
CSLib, `PFunctor.FreeM.bind_pure_comp`
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 8
Used by 17

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