Relation.RelatesWithinSteps.refl
theoremverifiedformalizationimported Lean
Relation.RelatesWithinSteps.refl
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {α : Type*} {r : α → α → Prop} {a b c : α} in lemma Relation.RelatesWithinSteps.refl (a : α) : RelatesWithinSteps r a a 0
- Formalizes
- CSLib, `Relation.RelatesWithinSteps.refl`
- 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.RelatesWithinSteps.refl← Relation.RelatesWithinSteps.refl (Cslib/Foundations/Data/RelatesInSteps.lean:162): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 3
- Relation.RelatesWithinSteps
RelatesWithinStepsis a variant ofRelatesInStepsthat allows for a loose bound. It states thatarelates tobin *at most*n… - Relation.RelatesWithinSteps.of_relatesInSteps
RelatesInStepsimpliesRelatesWithinStepswith the same bound. - 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…
- Relation.RelatesWithinSteps
- Used by 2
- exact_steiner_hopset_layered_dag_steiner_shortcutLet V and W be finite types, Gv a directed graph on V and ℓ : V → ℕ a layering such that every arc u → v of Gv has ℓ v = ℓ u + 1 (a…
- Relation.RelatesWithinSteps.zero_iffRelation.RelatesWithinSteps.zero_iff
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {α : Type*} {r : α → α → Prop} {a b c : α} in lemma Relation.RelatesWithinSteps.refl (a : α) : RelatesWithinSteps r a a 0 := RelatesWithinSteps.of_relatesInSteps (RelatesInSteps.refl a)