PFunctor.FreeM.induction
theoremverifiedformalizationimported Lean
An override for the default induction principle that is in simp-normal form. Note that when α and P.B a are in the same universe, this simplifies slightly further.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in universe u v uA uB in variable {P : PFunctor.{uA, uB}} {α β γ : Type*} in set_option linter.unusedVariables false in @[induction_eliminator] protected theorem PFunctor.FreeM.induction {motive : P.FreeM α → Prop} (pure : ∀ a, motive (pure a)) (lift_bind : ∀ (a : P.A) (cont : P.B a → P.FreeM α) (ih : ∀ i, motive (cont i)), motive ((FreeM.lift a).bind cont)) : ∀ x, motive x
- Formalizes
- CSLib, `PFunctor.FreeM.induction`
- 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.induction← PFunctor.FreeM.induction (Cslib/Foundations/Data/PFunctor/Free.lean:158): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 9
- PFunctor.FreeM.bind_eq_bindNote that this lemma does not always apply, as it is universe-constrained by
Bind.bind. - PFunctor.FreeM.pure_ne_liftPFunctor.FreeM.pure_ne_lift
- Cslib.FreeM.inductionAn override for the default induction principle that is in simp-normal form. Note that when
αandιare in the same universe, this… - PFunctor.FreeM.liftLift a shape of the base polynomial functor into the free monad.
- PFunctor.FreeM.liftBind_eqPFunctor.FreeM.liftBind_eq
- PFunctor.FreeM.lift_ne_purePFunctor.FreeM.lift_ne_pure
- PFunctor.FreeMThe free monad on a polynomial functor. This extends
WTypewith an extrapureconstructor. - PFunctor.FreeM.instPurePFunctor.FreeM.instPure
- PFunctor.FreeM.bindBind operation for the
FreeMmonad. The builtin>>=notation should be preferred whenαandβare in the same universe.
- PFunctor.FreeM.bind_eq_bindNote that this lemma does not always apply, as it is universe-constrained by
- Used by 8
- Cslib.FreeM.FreeCont.run_bindCslib.FreeM.FreeCont.run_bind
- Cslib.FreeM.FreeWriter.run_bindCslib.FreeM.FreeWriter.run_bind
- PFunctor.FreeM.Interprets.eqPFunctor.FreeM.Interprets.eq
- Cslib.FreeM.FreeState.run_bindCslib.FreeM.FreeState.run_bind
- Cslib.FreeM.FreeCont.run_toContTThe canonical interpreter
toContTderived fromliftMagrees with the hand-written recursive interpreterrunforFreeCont. - PFunctor.FreeM.liftM_bindPFunctor.FreeM.liftM_bind
- PFunctor.FreeM.bind_assocPFunctor.FreeM.bind_assoc
- 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 uA uB in variable {P : PFunctor.{uA, uB}} {α β γ : Type*} in set_option linter.unusedVariables false in /-- An override for the default induction principle that is in simp-normal form. Note that when `α` and `P.B a` are in the same universe, this simplifies slightly further. -/ @[induction_eliminator] protected theorem PFunctor.FreeM.induction {motive : P.FreeM α → Prop} (pure : ∀ a, motive (pure a)) (lift_bind : ∀ (a : P.A) (cont : P.B a → P.FreeM α) (ih : ∀ i, motive (cont i)), motive ((FreeM.lift a).bind cont)) : ∀ x, motive x | .pure a => pure a | liftBind a cont => lift_bind a cont fun u => FreeM.induction pure lift_bind (cont u)