AFTD Auto-Formalizing Theoretical Domains

Relation.RelatesWithinSteps.of_le

theoremverifiedformalizationimported Lean

Relation.RelatesWithinSteps.of_le

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {α : Type*} {r : α → α → Prop} {a b c : α} in
lemma Relation.RelatesWithinSteps.of_le {a b : α} {n₁ n₂ : ℕ}
    (h : RelatesWithinSteps r a b n₁) (hn : n₁ ≤ n₂) :
    RelatesWithinSteps r a b n₂
Formalizes
CSLib, `Relation.RelatesWithinSteps.of_le`
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 3

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {α : Type*} {r : α → α → Prop} {a b c : α} inlemma Relation.RelatesWithinSteps.of_le {a b : α} {n₁ n₂ : ℕ}    (h : RelatesWithinSteps r a b n₁) (hn : n₁ ≤ n₂) :    RelatesWithinSteps r a b n₂ := by  obtain ⟨m, hm, hevals⟩ := h  exact ⟨m, Nat.le_trans hm hn, hevals⟩
See it in the graphDiscuss this resultChallenge it