AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 6

Lean source view module on GitHub

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]
See it in the graphDiscuss this resultChallenge it