PFunctor.FreeM.comp_map
theoremverifiedformalizationimported Lean
PFunctor.FreeM.comp_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 theorem PFunctor.FreeM.comp_map (h : β → γ) (g : α → β) : ∀ x : P.FreeM α, map (h ∘ g) x = map h (map g x)
- Formalizes
- CSLib, `PFunctor.FreeM.comp_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.PFunctor.FreeM.comp_map← PFunctor.FreeM.comp_map (Cslib/Foundations/Data/PFunctor/Free.lean:230): verbatim
- Verified
- 08 Oct 2026
- Axioms
Quot.sound- Built on 6
- Cslib.FreeM.comp_mapCslib.FreeM.comp_map
- PFunctor.FreeM.id_mapPFunctor.FreeM.id_map
- PFunctor.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
WTypewith an extrapureconstructor. - PFunctor.FreeM.bind_pure_compPFunctor.FreeM.bind_pure_comp
- PFunctor.FreeM.mapMap a function over a
FreeMcomputation. The builtin<$>notation should be preferred whenαandβare in the same universe.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inuniverse u v uA uB invariable {P : PFunctor.{uA, uB}} {α β γ : Type*} intheorem PFunctor.FreeM.comp_map (h : β → γ) (g : α → β) : ∀ x : P.FreeM α, map (h ∘ g) x = map h (map g x) | .pure a => rfl | .liftBind a cont => by simp only [map] congr 1 funext u exact comp_map h g (cont u)