Relation.RelatesInSteps.head_induction_on
theoremverifiedformalizationimported Lean
Relation.RelatesInSteps.head_induction_on
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {α : Type*} {r : α → α → Prop} {a b c : α} in @[elab_as_elim] theorem Relation.RelatesInSteps.head_induction_on {motive : ∀ (a : α) (n : ℕ), RelatesInSteps r a b n → Prop} {a : α} {n : ℕ} (h : RelatesInSteps r a b n) (hrefl : motive b 0 (.refl b)) (hhead : ∀ {a c n} (h' : r a c) (h : RelatesInSteps r c b n), motive c n h → motive a (n + 1) (h.head a c b n h')) : motive a n h
- Formalizes
- CSLib, `Relation.RelatesInSteps.head_induction_on`
- Lean proof
- By Bolton Bailey, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2025 Bolton Bailey. 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.Relation.RelatesInSteps.head_induction_on← Relation.RelatesInSteps.head_induction_on (Cslib/Foundations/Data/RelatesInSteps.lean:59): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 2
- Relation.RelatesInSteps.headRelation.RelatesInSteps.head
- Relation.RelatesInStepsA relation
rrelates two elements ofαinnsteps if there is a chain ofnpairs(t_i, t_{i+1})such thatr t_i t_{i+1}for…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {α : Type*} {r : α → α → Prop} {a b c : α} in@[elab_as_elim]theorem Relation.RelatesInSteps.head_induction_on {motive : ∀ (a : α) (n : ℕ), RelatesInSteps r a b n → Prop} {a : α} {n : ℕ} (h : RelatesInSteps r a b n) (hrefl : motive b 0 (.refl b)) (hhead : ∀ {a c n} (h' : r a c) (h : RelatesInSteps r c b n), motive c n h → motive a (n + 1) (h.head a c b n h')) : motive a n h := by induction h with | refl => exact hrefl | tail t' b' m hstep hrt'b' hstep_ih => apply hstep_ih · exact hhead hrt'b' _ hrefl · exact fun h1 h2 ↦ hhead h1 (.tail _ t' b' _ h2 hrt'b')