[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Theorem except-refsizeeq-write-left
⊦ st0 =○refsize st1 → (st0[n, ablock] =○refsize st1 ↔ n ∈ st0 ∧ ablock.list = st0[n].list ∧ ablock.ladrlist = st0[n].ladrlist)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 16
Used lemmas:
except-refsize-eq
,
Used spec theorems:
Used simplifier rules:
ablock
/
elim
store
/ablock-store-nat-store/
At-same
ablock
/
inj
store
/ablock-store-nat-store/
insin
store
/ablock-store-nat-store/
in-neq
store
/ablock-store-nat-store/
At-other
ablock
/
sel-02
ablock
/
sel-01