Cslib.URM.Step.deterministic
theoremverifiedformalizationimported Lean
The step relation is deterministic: each state has at most one successor.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable (p : Program) in variable {p : Program} in set_option linter.tacticAnalysis.verifyGrindOnly false in theorem Cslib.URM.Step.deterministic : Relator.RightUnique (Step p)
- Formalizes
- CSLib, `Cslib.URM.Step.deterministic`
- Lean proof
- By Jesse Alama, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2026 Jesse Alama. 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.Cslib.URM.Step.deterministic← Cslib.URM.Step.deterministic (Cslib/Computability/URM/Execution.lean:87): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 6
- Cslib.URM.State.instDecidableIsHaltedCslib.URM.State.instDecidableIsHalted
- Cslib.URM.State.instInhabitedCslib.URM.State.instInhabited
- Cslib.URM.State.instReprCslib.URM.State.instRepr
- Cslib.URM.StepSingle-step execution relation for URMs. Each constructor corresponds to one of the four instruction types: -
zero: ExecuteZ n(set… - Cslib.URM.StateMachine state: program counter (0-indexed) and register contents.
- Cslib.URM.ProgramA URM program is a list of instructions.
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 (p : Program) invariable {p : Program} inset_option linter.tacticAnalysis.verifyGrindOnly false in/-- The step relation is deterministic: each state has at most one successor. -/theorem Cslib.URM.Step.deterministic : Relator.RightUnique (Step p) := by grind only [Relator.RightUnique]