AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
none — Lean reports it depends on no axioms
Built on 8
Used by 13

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 _
See it in the graphDiscuss this resultChallenge it