Cslib.FreeM.induction
theoremverifiedformalizationimported Lean
An override for the default induction principle that is in simp-normal form. Note that when α and ι are in the same universe, this simplifies slightly further.
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 set_option linter.unusedVariables false in @[induction_eliminator] protected theorem Cslib.FreeM.induction {motive : FreeM F α → Prop} (pure : ∀ a, motive (pure a)) (lift_bind : ∀ {ι} (op : F ι) (cont : ι → FreeM F α) (ih : ∀ i, motive (cont i)), motive ((lift op).bind cont)) : ∀ x, motive x
- Formalizes
- CSLib, `Cslib.FreeM.induction`
- 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.induction← Cslib.FreeM.induction (Cslib/Foundations/Control/Monad/Free.lean:149): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 8
- Cslib.FreeM.instFunctorCslib.FreeM.instFunctor
- Cslib.FreeM.liftBind_eqCslib.FreeM.liftBind_eq
- 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.bindBind operation for the
FreeMmonad. The builtin>>=notation should be preferred whenαandβare in the same universe. - Cslib.FreeM.instPureCslib.FreeM.instPure
- Cslib.FreeM.liftLift an operation from the effect signature
Finto theFreeM Fmonad. - 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 13
- Cslib.FreeM.FreeCont.run_bindCslib.FreeM.FreeCont.run_bind
- Cslib.FreeM.liftM_bindCslib.FreeM.liftM_bind
- Cslib.FreeM.FreeReader.run_withReaderCslib.FreeM.FreeReader.run_withReader
- Cslib.FreeM.Interprets.eqCslib.FreeM.Interprets.eq
- Cslib.FreeM.FreeWriter.run_bindCslib.FreeM.FreeWriter.run_bind
- Cslib.FreeM.FreeState.run_bindCslib.FreeM.FreeState.run_bind
- Cslib.FreeM.FreeCont.run_toContTThe canonical interpreter
toContTderived fromliftMagrees with the hand-written recursive interpreterrunforFreeCont. - Cslib.FreeM.bind_assocCslib.FreeM.bind_assoc
- Cslib.FreeM.FreeState.run_toStateMThe canonical interpreter
toStateMderived fromliftMagrees with the hand-written recursive interpreterrunforFreeState. - Cslib.FreeM.foldFreeM_uniqueUniversal Property: If
h : FreeM F α → βsatisfies: *h (pure a) = onValue a*… - PFunctor.FreeM.inductionAn override for the default induction principle that is in simp-normal form. Note that when
αandP.B aare in the same universe, this… - Cslib.FreeM.FreeReader.run_toReaderMThe canonical interpreter
toReaderMderived fromliftMagrees with the hand-written recursive interpreterrunforFreeReader - Cslib.FreeM.FreeWriter.run_toWriterTThe canonical interpreter
toWriterTderived fromliftMagrees with the hand-written recursive interpreterrunforFreeWriter.
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 set_option linter.unusedVariables false in /-- An override for the default induction principle that is in simp-normal form. Note that when `α` and `ι` are in the same universe, this simplifies slightly further. -/ @[induction_eliminator] protected theorem Cslib.FreeM.induction {motive : FreeM F α → Prop} (pure : ∀ a, motive (pure a)) (lift_bind : ∀ {ι} (op : F ι) (cont : ι → FreeM F α) (ih : ∀ i, motive (cont i)), motive ((lift op).bind cont)) : ∀ x, motive x | .pure a => pure a | liftBind _ _ => lift_bind _ _ fun _ => FreeM.induction pure lift_bind _