AFTD Auto-Formalizing Theoretical Domains

Relation.RelatesInSteps.head

theoremverifiedformalizationimported Lean

Relation.RelatesInSteps.head

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {α : Type*} {r : α → α → Prop} {a b c : α} in
theorem Relation.RelatesInSteps.head (t t' t'' : α) (n : ℕ) (h₁ : r t t')
    (h₂ : RelatesInSteps r t' t'' n) : RelatesInSteps r t t'' (n+1)
Formalizes
CSLib, `Relation.RelatesInSteps.head`
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.
Verified
08 Oct 2026
Axioms
none — Lean reports it depends on no axioms
Built on 2
Used by 3

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {α : Type*} {r : α → α → Prop} {a b c : α} intheorem Relation.RelatesInSteps.head (t t' t'' : α) (n : ℕ) (h₁ : r t t')    (h₂ : RelatesInSteps r t' t'' n) : RelatesInSteps r t t'' (n+1) := by  induction h₂ with  | refl =>    exact single h₁  | tail _ _ n _ hcd hac =>    exact tail _ _ _ (n + 1) hac hcd
See it in the graphDiscuss this resultChallenge it