AFTD Auto-Formalizing Theoretical Domains

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

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