Relation.RelatesWithinSteps.zero
theoremverifiedformalizationimported Lean
Relation.RelatesWithinSteps.zero
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {α : Type*} {r : α → α → Prop} {a b c : α} in lemma Relation.RelatesWithinSteps.zero {a b : α} (h : RelatesWithinSteps r a b 0) : a = b
- Formalizes
- CSLib, `Relation.RelatesWithinSteps.zero`
- 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.zero← Relation.RelatesWithinSteps.zero (Cslib/Foundations/Data/RelatesInSteps.lean:168): 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.RelatesInSteps.zeroRelation.RelatesInSteps.zero
- 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 1
- Relation.RelatesWithinSteps.zero_iffRelation.RelatesWithinSteps.zero_iff
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {α : Type*} {r : α → α → Prop} {a b c : α} inlemma Relation.RelatesWithinSteps.zero {a b : α} (h : RelatesWithinSteps r a b 0) : a = b := by obtain ⟨m, hm, hevals⟩ := h have : m = 0 := Nat.le_zero.mp hm subst this exact RelatesInSteps.zero hevals