AFTD Auto-Formalizing Theoretical Domains

Relation.RelatesInSteps.map

theoremverifiedformalizationimported Lean

If g is a homomorphism from r to r' (i.e., it preserves the reduction relation), then RelatesInSteps 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.RelatesInSteps.map {α α' : Type*}
    {r : α → α → Prop} {r' : α' → α' → Prop}
    (g : α → α') (hg : ∀ a b, r a b → r' (g a) (g b))
    {a b : α} {n : ℕ} (h : RelatesInSteps r a b n) :
    RelatesInSteps r' (g a) (g b) n
Formalizes
CSLib, `Relation.RelatesInSteps.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.
Verified
08 Oct 2026
Axioms
none — Lean reports it depends on no axioms
Built on 1
  • Relation.RelatesInStepsA relation r relates two elements of α in n steps if there is a chain of n pairs (t_i, t_{i+1}) such that r t_i t_{i+1} for…
Used by 2

Lean source view module on GitHub

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 `RelatesInSteps` is preserved under `g`. -/lemma Relation.RelatesInSteps.map {α α' : Type*}    {r : α → α → Prop} {r' : α' → α' → Prop}    (g : α → α') (hg : ∀ a b, r a b → r' (g a) (g b))    {a b : α} {n : ℕ} (h : RelatesInSteps r a b n) :    RelatesInSteps r' (g a) (g b) n := by  induction h with  | refl => exact RelatesInSteps.refl (g _)  | tail t' t'' m _ hstep ih =>    exact .tail (g _) (g t') (g t'') m ih (hg t' t'' hstep)
See it in the graphDiscuss this resultChallenge it