Relation.RelatesInSteps.succ_iff
theoremverifiedformalizationimported Lean
Relation.RelatesInSteps.succ_iff
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {α : Type*} {r : α → α → Prop} {a b c : α} in lemma Relation.RelatesInSteps.succ_iff {a b : α} {n : ℕ} : RelatesInSteps r a b (n + 1) ↔ ∃ t', RelatesInSteps r a t' n ∧ r t' b
- Formalizes
- CSLib, `Relation.RelatesInSteps.succ_iff`
- 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.succ_iff← Relation.RelatesInSteps.succ_iff (Cslib/Foundations/Data/RelatesInSteps.lean:96): verbatim
- Verified
- 08 Oct 2026
- Axioms
propext- Built on 2
- 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.succRelation.RelatesInSteps.succ
- Relation.RelatesInStepsA relation
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.succ_iff {a b : α} {n : ℕ} : RelatesInSteps r a b (n + 1) ↔ ∃ t', RelatesInSteps r a t' n ∧ r t' b := by constructor · exact RelatesInSteps.succ · rintro ⟨t', h_steps, h_red⟩ exact .tail _ t' b n h_steps h_red