AFTD Auto-Formalizing Theoretical Domains

Relation.RelatesWithinSteps.of_relatesInSteps

theoremverifiedformalizationimported Lean

RelatesInSteps implies RelatesWithinSteps with the same bound.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {α : Type*} {r : α → α → Prop} {a b c : α} in
lemma Relation.RelatesWithinSteps.of_relatesInSteps {a b : α} {n : ℕ} (h : RelatesInSteps r a b n) :
    RelatesWithinSteps r a b n
Formalizes
CSLib, `Relation.RelatesWithinSteps.of_relatesInSteps`
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
  • Relation.RelatesWithinStepsRelatesWithinSteps is a variant of RelatesInSteps that allows for a loose bound. It states that a relates to b in *at most* n…
  • 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 in
set_option relaxedAutoImplicit true in
variable {α : Type*} {r : α → α → Prop} {a b c : α} in
/-- `RelatesInSteps` implies `RelatesWithinSteps` with the same bound. -/
lemma Relation.RelatesWithinSteps.of_relatesInSteps {a b : α} {n : ℕ} (h : RelatesInSteps r a b n) :
    RelatesWithinSteps r a b n :=
  ⟨n, Nat.le_refl n, h⟩
See it in the graphDiscuss this resultChallenge it