[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 in-write-refsize
⊦ n ∈ st → (adr ∈ st[n, st[n].ref-size:= m] ↔ adr ∈ st)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
at-write-refsize
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 10
Used lemmas:
in
,
Used spec theorems:
store
/ablock-store-nat-store/
At-other
Used simplifier rules:
address-data
/
elim
ablock
/
elim
address-data
/
sel-05
address-data
/
sel-04
address-data
/
sel-03
store
/ablock-store-nat-store/
in-neq
ablock
/
inj
store
/ablock-store-nat-store/
At-same
store
/ablock-store-nat-store/
insin
ablock
/
upd-03