AFTD Auto-Formalizing Theoretical Domains

PFunctor.FreeM.bind_pure

theoremverifiedformalizationimported Lean

PFunctor.FreeM.bind_pure

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 : ∀ x : P.FreeM α, x.bind pure = x
Formalizes
CSLib, `PFunctor.FreeM.bind_pure`
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.sound
Built on 5
Used by 13

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 : ∀ x : P.FreeM α, x.bind pure = x  | .pure a => rfl  | .liftBind a cont => by    simp only [FreeM.bind]; congr 1; funext u; exact bind_pure (cont u)
See it in the graphDiscuss this resultChallenge it