AFTD Auto-Formalizing Theoretical Domains

Cslib.FreeM.pure_bind

theoremverifiedformalizationimported Lean

.pure a followed by bind collapses immediately.

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.pure_bind (a : α) (f : α → FreeM F β) : (pure a : FreeM F α).bind f = f a
Formalizes
CSLib, `Cslib.FreeM.pure_bind`
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
none — Lean reports it depends on no axioms
Built on 6
Used by 70

Lean source view module on GitHub

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
/-- `.pure a` followed by `bind` collapses immediately. -/
@[simp]
lemma Cslib.FreeM.pure_bind (a : α) (f : α → FreeM F β) : (pure a : FreeM F α).bind f = f a := rfl
See it in the graphDiscuss this resultChallenge it