AFTD Auto-Formalizing Theoretical Domains

PFunctor.FreeM.map_eq_map

theoremverifiedformalizationimported Lean

Note that this lemma does not always apply, as it is universe-constrained by Functor.map.

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]
theorem PFunctor.FreeM.map_eq_map {α β : Type v} :
    FreeM.map (P := P) (α := α) (β := β) = Functor.map
Formalizes
CSLib, `PFunctor.FreeM.map_eq_map`
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 4
  • Cslib.FreeM.map_eq_mapNote that this lemma does not always apply, as it is universe-constrained by Functor.map.
  • PFunctor.FreeMThe free monad on a polynomial functor. This extends WType with an extra pure constructor.
  • PFunctor.FreeM.mapMap a function over a FreeM computation. The builtin <$> notation should be preferred when α and β are in the same universe.
  • PFunctor.FreeM.instFunctorPFunctor.FreeM.instFunctor
Used by 11

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u v uA uB in
variable {P : PFunctor.{uA, uB}} {α β γ : Type*} in
/-- Note that this lemma does not always apply, as it is universe-constrained by `Functor.map`. -/
@[simp]
theorem PFunctor.FreeM.map_eq_map {α β : Type v} :
    FreeM.map (P := P) (α := α) (β := β) = Functor.map := rfl
See it in the graphDiscuss this resultChallenge it