Relation.RelatesWithinSteps.map
theoremverifiedformalizationimported Lean
If g is a homomorphism from r to r' (i.e., it preserves the reduction relation), then RelatesWithinSteps is preserved under g.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {α : Type*} {r : α → α → Prop} {a b c : α} in lemma Relation.RelatesWithinSteps.map {α α' : Type*} {r : α → α → Prop} {r' : α' → α' → Prop} (g : α → α') (hg : ∀ a b, r a b → r' (g a) (g b)) {a b : α} {n : ℕ} (h : RelatesWithinSteps r a b n) : RelatesWithinSteps r' (g a) (g b) n
- Formalizes
- CSLib, `Relation.RelatesWithinSteps.map`
- 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.map← Relation.RelatesWithinSteps.map (Cslib/Foundations/Data/RelatesInSteps.lean:214): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 4
- Relation.RelatesInSteps.mapIf
gis a homomorphism fromrtor'(i.e., it preserves the reduction relation), thenRelatesInStepsis preserved underg. - Relation.RelatesWithinSteps
RelatesWithinStepsis a variant ofRelatesInStepsthat allows for a loose bound. It states thatarelates tobin *at most*n… - Relation.RelatesWithinSteps.zero_iffRelation.RelatesWithinSteps.zero_iff
- 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.RelatesInSteps.mapIf
- Used by 3
- 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…
- Cslib.Turing.SingleTapeTM.comp_right_relatesWithinStepsSimulation for the second phase of the composed computer. When the second machine runs from start to halt, the composed machine runs from…
- Cslib.Turing.SingleTapeTM.comp_left_relatesWithinStepsSimulation for the first phase of the composed computer. When the first machine runs from start to halt, the composed machine runs from…
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 : α} in/-- If `g` is a homomorphism from `r` to `r'` (i.e., it preserves the reduction relation), then `RelatesWithinSteps` is preserved under `g`. -/lemma Relation.RelatesWithinSteps.map {α α' : Type*} {r : α → α → Prop} {r' : α' → α' → Prop} (g : α → α') (hg : ∀ a b, r a b → r' (g a) (g b)) {a b : α} {n : ℕ} (h : RelatesWithinSteps r a b n) : RelatesWithinSteps r' (g a) (g b) n := by obtain ⟨m, hm, hevals⟩ := h exact ⟨m, hm, RelatesInSteps.map g hg hevals⟩