Relation.RelatesInSteps.zero_iff
theoremverifiedformalizationimported Lean
Relation.RelatesInSteps.zero_iff
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {α : Type*} {r : α → α → Prop} {a b c : α} in @[simp] lemma Relation.RelatesInSteps.zero_iff {a b : α} : RelatesInSteps r a b 0 ↔ a = b
- Formalizes
- CSLib, `Relation.RelatesInSteps.zero_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.zero_iff← Relation.RelatesInSteps.zero_iff (Cslib/Foundations/Data/RelatesInSteps.lean:76): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 2
- Relation.RelatesInSteps.zeroRelation.RelatesInSteps.zero
- 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…
- Used by 8
- Cslib.Turing.SingleTapeTM.TimeComputableA Turing machine + a time function + a proof it outputs
fin at mosttime(input.length)steps. - Cslib.Turing.SingleTapeTM.PolyTimeComputable.idA proof that the identity map on Symbol is computable in polytime.
- Cslib.Turing.SingleTapeTM.OutputsWithinTimeA proof of
tmoutputtingl'on inputlin at mostmsteps. - 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.PolyTimeComputableA Turing machine + a polynomial time function + a proof it outputs
fin at mosttime(input.length)steps. - Relation.RelatesInSteps.succ'Relation.RelatesInSteps.succ'
- 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…
- Cslib.Turing.SingleTapeTM.TimeComputable.idThe identity map on Symbol is computable in constant time.
- Cslib.Turing.SingleTapeTM.TimeComputableA Turing machine + a time function + a proof it outputs
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@[simp]lemma Relation.RelatesInSteps.zero_iff {a b : α} : RelatesInSteps r a b 0 ↔ a = b := by constructor · exact RelatesInSteps.zero · intro rfl exact RelatesInSteps.refl a