AFTD Auto-Formalizing Theoretical Domains

PFunctor.FreeM.pure_inj

theoremverifiedformalizationimported Lean

PFunctor.FreeM.pure_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
@[simp]
lemma PFunctor.FreeM.pure_inj (a b : α) : (pure a : P.FreeM α) = pure b ↔ a = b
Formalizes
CSLib, `PFunctor.FreeM.pure_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 2
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_inj (a b : α) : (pure a : P.FreeM α) = pure b ↔ a = b := by  constructor  · intro h    cases h    rfl  · rintro rfl; rfl
See it in the graphDiscuss this resultChallenge it