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.Cslib.FreeM.map_eq_map← Cslib.FreeM.map_eq_map (Cslib/Foundations/Control/Monad/Free.lean:133): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 6
- Cslib.FreeM.instFunctorCslib.FreeM.instFunctor
- Cslib.FreeM.mapMap a function over a
FreeMmonad. The builtin<$>notation should be preferred whenαandβare in the same universe. - Cslib.FreeM.bind_eq_bindNote that this lemma does not always apply, as it is universe-constrained by
Bind.bind. - Cslib.FreeM.instBindCslib.FreeM.instBind
- Cslib.FreeM.instPureCslib.FreeM.instPure
- Cslib.FreeMThe Free monad over a type constructor
F. AFreeM F ais a tree of operations from the type constructorF, with leaves of typea.…
- Used by 74
- Cslib.FreeM.FreeState.toStateMConvert a
FreeStatecomputation into aStateMcomputation. This is the canonical interpreter derived fromliftM. - Cslib.FreeM.FreeCont.run_bindCslib.FreeM.FreeCont.run_bind
- Cslib.FreeM.FreeWriter.writerInterpInterpret
WriterFoperations intoWriterT. - Cslib.FreeM.FreeWriter.pass_defCslib.FreeM.FreeWriter.pass_def
- Cslib.FreeM.FreeWriter.runInterprets a
FreeWritercomputation by recursively traversing the tree, accumulating log entries with the monoid operation, and returns… - Cslib.FreeM.FreeCont.toContT_unique
toContTis the unique interpreter extendingcontInterp. - Cslib.FreeM.liftM_seqLeftCslib.FreeM.liftM_seqLeft
- Cslib.FreeM.liftM_bindCslib.FreeM.liftM_bind
- Cslib.FreeM.FreeState.run_pureCslib.FreeM.FreeState.run_pure
- Cslib.FreeM.FreeWriter.tellWrites a log entry. This creates an effectful node in the computation tree.
- Cslib.FreeM.FreeState.run'_setCslib.FreeM.FreeState.run'_set
- Cslib.FreeM.FreeWriter.tell_defCslib.FreeM.FreeWriter.tell_def
- Cslib.FreeM.comp_mapCslib.FreeM.comp_map
- Cslib.FreeM.FreeReader.run_pureCslib.FreeM.FreeReader.run_pure
- Cslib.FreeM.foldFreeM_lift_bindCslib.FreeM.foldFreeM_lift_bind
- Cslib.FreeM.FreeReader.read_defCslib.FreeM.FreeReader.read_def
- Cslib.FreeM.FreeWriter.pass
passallows a subcomputation to modify its own log. After traversing the computation and accumulating its log, the resulting function is… - Cslib.FreeM.FreeReader.run_withReaderCslib.FreeM.FreeReader.run_withReader
- Cslib.FreeM.Interprets.eqCslib.FreeM.Interprets.eq
- PFunctor.FreeM.map_eq_mapNote that this lemma does not always apply, as it is universe-constrained by
Functor.map. - Cslib.FreeM.foldFreeM_lift_bind'Cslib.FreeM.foldFreeM_lift_bind'
- Cslib.FreeM.FreeWriter.run_lift_tellCslib.FreeM.FreeWriter.run_lift_tell
- Cslib.FreeM.FreeWriter.run_bindCslib.FreeM.FreeWriter.run_bind
- Cslib.FreeM.FreeState.run'_pureCslib.FreeM.FreeState.run'_pure
- Cslib.FreeM.FreeWriter.listen_pureCslib.FreeM.FreeWriter.listen_pure
- Cslib.FreeM.Interprets.liftMCslib.FreeM.Interprets.liftM
- Cslib.FreeM.map_bindCslib.FreeM.map_bind
- Cslib.FreeM.FreeReader.runRun a reader computation
- Cslib.FreeM.FreeWriter.run_pureCslib.FreeM.FreeWriter.run_pure
- Cslib.FreeM.FreeState.instMonadStateOfCslib.FreeM.FreeState.instMonadStateOf
- Cslib.FreeM.FreeWriter.listen
listencaptures the log produced by a subcomputation incrementally. It traverses the computation, emitting log entries as encountered,… - Cslib.FreeM.liftM_seqRightCslib.FreeM.liftM_seqRight
- Cslib.FreeM.FreeState.toStateM_unique
toStateMis the unique interpreter extendingstateInterp. - Cslib.FreeM.FreeState.run'_getCslib.FreeM.FreeState.run'_get
- Cslib.FreeM.FreeCont.run_pureCslib.FreeM.FreeCont.run_pure
- Cslib.FreeM.FreeState.run_bindCslib.FreeM.FreeState.run_bind
- Cslib.FreeM.liftM_liftCslib.FreeM.liftM_lift
- Cslib.FreeM.FreeReader.toReaderMConvert a
FreeReadercomputation into aReaderMcomputation. This is the canonical interpreter derived fromliftM. - Cslib.FreeM.instFunctorContFCslib.FreeM.instFunctorContF
- Cslib.FreeM.map_pureCslib.FreeM.map_pure
- Cslib.FreeM.FreeState.run_setCslib.FreeM.FreeState.run_set
- Cslib.FreeM.FreeCont.run_toContTThe canonical interpreter
toContTderived fromliftMagrees with the hand-written recursive interpreterrunforFreeCont. - Cslib.FreeM.FreeCont.run_callCC
runof acallCCnode simplifies to running the handler with the current continuation. - Cslib.FreeM.id_mapCslib.FreeM.id_map
- Cslib.FreeM.FreeReader.run_bindCslib.FreeM.FreeReader.run_bind
- Cslib.FreeM.InterpretsA predicate stating that
interp : FreeM F α → m αis an interpreter for the effect handlerhandler : ∀ {α}, F α → m α. This means that… - Cslib.FreeM.FreeReader.run_readCslib.FreeM.FreeReader.run_read
- Cslib.FreeM.FreeState.run_toStateMThe canonical interpreter
toStateMderived fromliftMagrees with the hand-written recursive interpreterrunforFreeState. - Cslib.FreeM.liftM_seqCslib.FreeM.liftM_seq
- Cslib.FreeM.foldFreeM_liftCslib.FreeM.foldFreeM_lift
- Cslib.FreeM.FreeCont.callCCCall with current continuation for the Free continuation monad.
- Cslib.FreeM.FreeReader.instMonadWithReaderOfCslib.FreeM.FreeReader.instMonadWithReaderOf
- Cslib.FreeM.FreeState.set_defCslib.FreeM.FreeState.set_def
- Cslib.FreeM.FreeReader.toReaderM_unique
toReaderMis the unique interpreter extendingreadInterp. - Cslib.FreeM.FreeState.run'_toStateMCslib.FreeM.FreeState.run'_toStateM
- Cslib.FreeM.liftM_mapCslib.FreeM.liftM_map
- Cslib.FreeM.foldFreeM_uniqueUniversal Property: If
h : FreeM F α → βsatisfies: *h (pure a) = onValue a*… - Cslib.FreeM.FreeCont.instMonadContCslib.FreeM.FreeCont.instMonadCont
- Cslib.FreeM.FreeState.run_getCslib.FreeM.FreeState.run_get
- Cslib.FreeM.bind_pure_compCslib.FreeM.bind_pure_comp
- Cslib.FreeM.FreeState.get_defCslib.FreeM.FreeState.get_def
- Cslib.FreeM.FreeWriter.instMonadWriterOfMonoidCslib.FreeM.FreeWriter.instMonadWriterOfMonoid
- Cslib.FreeM.FreeWriter.listen_lift_tell_bindCslib.FreeM.FreeWriter.listen_lift_tell_bind
- Cslib.FreeM.Interprets.iffThe universal property of the free monad
FreeM. That is,liftM handleris the unique interpreter that extends the effect handler… - Cslib.FreeM.FreeCont.run_lift_callCCCslib.FreeM.FreeCont.run_lift_callCC
- Cslib.FreeM.FreeReader.run_toReaderMThe canonical interpreter
toReaderMderived fromliftMagrees with the hand-written recursive interpreterrunforFreeReader - Cslib.FreeM.FreeReader.instMonadReaderOfCslib.FreeM.FreeReader.instMonadReaderOf
- Cslib.FreeM.FreeReader.instMonadReaderCslib.FreeM.FreeReader.instMonadReader
- Cslib.FreeM.FreeWriter.toWriterTConvert a
FreeWritercomputation into aWriterTcomputation. This is the canonical interpreter derived fromliftM. - Cslib.FreeM.FreeWriter.run_toWriterTThe canonical interpreter
toWriterTderived fromliftMagrees with the hand-written recursive interpreterrunforFreeWriter. - Cslib.FreeM.FreeState.runRun a state computation, returning both the result and final state.
- Cslib.FreeM.FreeWriter.toWriterT_unique
toWriterTis the unique interpreter extendingwriterInterp. - Cslib.FreeM.FreeState.run'Run a state computation, returning only the result.
- Cslib.FreeM.FreeState.run'_bindCslib.FreeM.FreeState.run'_bind
- Cslib.FreeM.FreeState.toStateMConvert a
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