[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-append
n ∈ st, ¬ ladr ∈ lax ⊦ inv(mkblock(x, lax, m0)) ∧ st[n] = mkblock(x, lax, m0) → nodes(st[n, mkblock(x + a ', lax + ladr ', m1)]) = nodes(st)[@(n, ladr.off, ladr.size), a]
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: 9
Proof steps: 30
Used lemmas:
at-nodes
,
in-nodes
,
Used spec theorems:
store
/address-store/
k-Extension
ablock-store-inv
/
inv-block
list-del
/laddress-list/
app-05-neg
list-del
/
get-append-grt
ablock-store-inv
/
at
Used simplifier rules:
laddress
/
elim
list
/address-list-set/
in-17
laddress
/
sel-01
laddress
/
sel-02
ablock-store-inv
/
to-adrs-one
ablock-store-inv
/
inv-eq-list-size
store
/address-store/
At-same
store
/address-store/
insin
list-del
/laddress-list/
app-05-neg
list-del
/laddress-list/
pos-one
nat-basic
/
add-base
nat-basic
/
a
nat-basic
/
c
list-del
/
get-last
ablock-store-inv
/
in-write-explicit
store
/address-store/
At-other
store
/address-store/
in-neq
ablock-store-inv
/
in-write-app
list
/laddress-list/
len-02
list
/
len-02
address-data
/
elim
ablock
/
elim
list
/
in-17
list
/
in-append
list
/laddress-list/
in-17
list
/laddress-list/
in-append
list
/
in-15
list
/laddress-list/
in-15
ablock
/
inj
store
/ablock-store-nat-store/
At-same
list-del
/laddress-list/
notin-03
ablock-store-inv
/
in-adr-in
list
/laddress-list/
a
list-del
/laddress-list/
app-05
nat
/
lels
list-del
/laddress-list/
inl-01
list-del
/
get-butlast
list
/
a
store
/ablock-store-nat-store/
At-other
address-data
/
sel-03
address-data
/
sel-04
address-data
/
sel-05
ablock
/
sel-01
ablock
/
sel-02