AFTD Auto-Formalizing Theoretical Domains

Cslib.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 w w' w'' in
variable {F : Type u → Type v} {ι : Type u} {α : Type w} {β : Type w'} {γ : Type w''} in
@[simp]
theorem Cslib.FreeM.map_eq_map {α β : Type w} : FreeM.map (F := F) (α := α) (β := β) = Functor.map
Formalizes
CSLib, `Cslib.FreeM.map_eq_map`
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 74

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
/-- Note that this lemma does not always apply, as it is universe-constrained by `Functor.map`. -/
@[simp]
theorem Cslib.FreeM.map_eq_map {α β : Type w} : FreeM.map (F := F) (α := α) (β := β) = Functor.map := rfl
See it in the graphDiscuss this resultChallenge it