AFTD Auto-Formalizing Theoretical Domains

Cslib.URM.Step.preserves_register

theoremverifiedformalizationimported Lean

A single step preserves registers not written to by the current instruction. This is a fundamental property of URM execution: each instruction modifies at most one register (Z, S, T write to one register; J writes to none).

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable (p : Program) in
variable {p : Program} in
theorem Cslib.URM.Step.preserves_register {s s' : State} {r : ℕ}
    (hstep : Step p s s')
    (hr : ∀ instr, p[s.pc]? = some instr → instr.writesTo ≠ some r) :
    s'.regs.read r = s.regs.read r
Formalizes
CSLib, `Cslib.URM.Step.preserves_register`
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
propext
Built on 10
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable (p : Program) invariable {p : Program} in/-- A single step preserves registers not written to by the current instruction. This is a fundamental property of URM execution: each instruction modifies at most one register (Z, S, T write to one register; J writes to none). -/theorem Cslib.URM.Step.preserves_register {s s' : State} {r : ℕ}    (hstep : Step p s s')    (hr : ∀ instr, p[s.pc]? = some instr → instr.writesTo ≠ some r) :    s'.regs.read r = s.regs.read r := by  cases hstep with  | zero hinstr | succ hinstr | transfer hinstr =>    have := hr _ hinstr    simp only [Instr.writesTo, ne_eq, Option.some.injEq] at this    exact Function.update_of_ne (Ne.symm this) _ _  | jump_eq _ _ | jump_ne _ _ => rfl
See it in the graphDiscuss this resultChallenge it