Relation.RelatesInSteps.trans
theoremverifiedformalizationimported Lean
Relation.RelatesInSteps.trans
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {α : Type*} {r : α → α → Prop} {a b c : α} in lemma Relation.RelatesInSteps.trans {a b c : α} {n m : ℕ} (h₁ : RelatesInSteps r a b n) (h₂ : RelatesInSteps r b c m) : RelatesInSteps r a c (n + m)
- Formalizes
- CSLib, `Relation.RelatesInSteps.trans`
- 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.trans← Relation.RelatesInSteps.trans (Cslib/Foundations/Data/RelatesInSteps.lean:82): verbatim
- Verified
- 08 Oct 2026
- Axioms
propext- 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 1
- Relation.RelatesWithinSteps.transTransitivity of
RelatesWithinStepsin the sum of the step bounds.
- Relation.RelatesWithinSteps.transTransitivity of
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.RelatesInSteps.trans {a b c : α} {n m : ℕ} (h₁ : RelatesInSteps r a b n) (h₂ : RelatesInSteps r b c m) : RelatesInSteps r a c (n + m) := by induction h₂ generalizing a n with | refl => simp [h₁] | tail t' t'' k hsteps hstep ih => rw [← Nat.add_assoc] exact .tail _ t' t'' (n + k) (ih h₁) hstep