AFTD Auto-Formalizing Theoretical Domains

Relation.RelatesInSteps.succ

theoremverifiedformalizationimported Lean

Relation.RelatesInSteps.succ

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {α : Type*} {r : α → α → Prop} {a b c : α} in
lemma Relation.RelatesInSteps.succ {n : ℕ} (h : RelatesInSteps r a b (n + 1)) :
    ∃ t', RelatesInSteps r a t' n ∧ r t' b
Formalizes
CSLib, `Relation.RelatesInSteps.succ`
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
propext
Built on 1
  • Relation.RelatesInStepsA relation r relates two elements of α in n steps if there is a chain of n pairs (t_i, t_{i+1}) such that r t_i t_{i+1} for…
Used by 2

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {α : Type*} {r : α → α → Prop} {a b c : α} inlemma Relation.RelatesInSteps.succ {n : ℕ} (h : RelatesInSteps r a b (n + 1)) :    ∃ t', RelatesInSteps r a t' n ∧ r t' b := by  cases h with  | tail t' _ _ hsteps hstep => exact ⟨t', hsteps, hstep⟩
See it in the graphDiscuss this resultChallenge it