[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 nodes-alloc
¬ n ∈ st ⊦ nodes(st[n, mkblock([], [], m)]) = nodes(st)
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: 5
Proof steps: 11
Used lemmas:
at-nodes
,
in-nodes
,
Used spec theorems:
store
/address-store/
k-Extension
ablock-store-inv
/
in
store
/ablock-store-nat-store/
In-insert
store
/ablock-store-nat-store/
At-other
Used simplifier rules:
ablock-store-inv
/
in-alloc
address-data
/
elim
ablock
/
elim
store
/ablock-store-nat-store/
At-same
ablock
/
inj
ablock-store-inv
/
notin-notin
list
/laddress-list/
in-empty
ablock-store-inv
/
at-explicit-other
ablock-store-inv
/
in-in-adr