Cslib.URM.State.ext
theoremverifiedformalizationimported Lean
Extensionality for State: two states are equal iff their components are equal.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in @[ext] theorem Cslib.URM.State.ext {s₁ s₂ : State} (hpc : s₁.pc = s₂.pc) (hregs : s₁.regs = s₂.regs) : s₁ = s₂
- Formalizes
- CSLib, `Cslib.URM.State.ext`
- 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.State.ext← Cslib.URM.State.ext (Cslib/Computability/URM/Basic.lean:59): verbatim
- Verified
- 08 Oct 2026
- Axioms
propext- Built on 7
- Cslib.URM.State.instDecidableIsHaltedCslib.URM.State.instDecidableIsHalted
- Cslib.URM.RegsRegister contents: maps register indices to natural number contents. Uses the functional representation
ℕ → ℕfor efficiency with… - Cslib.URM.Regs.write_read_selfCslib.URM.Regs.write_read_self
- Cslib.URM.State.instInhabitedCslib.URM.State.instInhabited
- Cslib.URM.Regs.write_read_of_neCslib.URM.Regs.write_read_of_ne
- Cslib.URM.State.instReprCslib.URM.State.instRepr
- Cslib.URM.StateMachine state: program counter (0-indexed) and register contents.
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 in/-- Extensionality for State: two states are equal iff their components are equal. -/@[ext]theorem Cslib.URM.State.ext {s₁ s₂ : State} (hpc : s₁.pc = s₂.pc) (hregs : s₁.regs = s₂.regs) : s₁ = s₂ := by cases s₁; cases s₂; simp only at hpc hregs; simp [hpc, hregs]