[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 prefix-alloc
⊦ ¬ n ∈ st ∧ inv(st) → st ⊑ st[n, mkblock(x, lax, n0)]
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: 6
Used lemmas:
blockstore-prefix
,
inv-block
,
inv-store
,
Used spec theorems:
Used simplifier rules:
list-last
/laddress-list/
prefix-self
list-last
/
prefix-self
store
/ablock-store-nat-store/
At-in-out
set-basic
/nat-set/
sub-add-01
store+set
/ablock-store-nat-store/
dom-ins
ablock
/
elim
ablock
/
sel-01
ablock
/
sel-02