Relation.RelatesInSteps.single
theoremverifiedformalizationimported Lean
Relation.RelatesInSteps.single
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {α : Type*} {r : α → α → Prop} {a b c : α} in lemma Relation.RelatesInSteps.single {a b : α} (h : r a b) : RelatesInSteps r a b 1
- Formalizes
- CSLib, `Relation.RelatesInSteps.single`
- 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.single← Relation.RelatesInSteps.single (Cslib/Foundations/Data/RelatesInSteps.lean:47): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 1
- 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.RelatesInStepsA relation
- Used by 3
- Relation.RelatesInSteps.headRelation.RelatesInSteps.head
- Relation.RelatesWithinSteps.singleRelation.RelatesWithinSteps.single
- Cslib.Turing.SingleTapeTM.TimeComputable.idThe identity map on Symbol is computable in constant time.
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.RelatesInSteps.single {a b : α} (h : r a b) : RelatesInSteps r a b 1 := tail a a b 0 (refl a) h