AFTD Auto-Formalizing Theoretical Domains

PFunctor.FreeM.pure_eq_bind_iff

theoremverifiedformalizationimported Lean

PFunctor.FreeM.pure_eq_bind_iff

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.pure_eq_bind_iff (x : P.FreeM α) (f : α → P.FreeM β) (b : β) :
    pure b = x.bind f ↔ ∃ a, x = pure a ∧ pure b = f a
Formalizes
CSLib, `PFunctor.FreeM.pure_eq_bind_iff`
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
none — Lean reports it depends on no axioms
Built on 6
Used by 2

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.pure_eq_bind_iff (x : P.FreeM α) (f : α → P.FreeM β) (b : β) :    pure b = x.bind f ↔ ∃ a, x = pure a ∧ pure b = f a := by  cases x with  | pure a => exact ⟨fun h => ⟨a, rfl, h⟩, fun ⟨_, h, hf⟩ => by cases h; exact hf⟩  | liftBind a cont =>    constructor    · intro h      cases h    · rintro ⟨_, h, _⟩      cases h
See it in the graphDiscuss this resultChallenge it