AFTD Auto-Formalizing Theoretical Domains

PFunctor.FreeM.liftBind_inj

theoremverifiedformalizationimported Lean

PFunctor.FreeM.liftBind_inj

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u v uA uB in
variable {P : PFunctor.{uA, uB}} {α β γ : Type*} in
lemma PFunctor.FreeM.liftBind_inj (a a' : P.A)
    (cont : P.B a → P.FreeM α) (cont' : P.B a' → P.FreeM α) :
    FreeM.liftBind a cont = FreeM.liftBind a' cont' ↔ ∃ h : a = a', h ▸ cont = cont'
Formalizes
CSLib, `PFunctor.FreeM.liftBind_inj`
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 1
  • PFunctor.FreeMThe free monad on a polynomial functor. This extends WType with an extra pure constructor.

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*} inlemma PFunctor.FreeM.liftBind_inj (a a' : P.A)    (cont : P.B a → P.FreeM α) (cont' : P.B a' → P.FreeM α) :    FreeM.liftBind a cont = FreeM.liftBind a' cont' ↔ ∃ h : a = a', h ▸ cont = cont' := by  constructor  · intro h    cases h    exact ⟨rfl, rfl⟩  · rintro ⟨rfl, rfl⟩    rfl
See it in the graphDiscuss this resultChallenge it