[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 index-update-at-last-oc
⊦ # ax = # kx0 + # kx1 + 1 ∧ ¬ key ∈ kx1 → ri[kx0 + key ' + kx1, ax][key] = ax[# kx0]
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
gjournal-base
,
aubifs-inv
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 11
Used lemmas:
keys-at-other
,
index-update-key-rec
,
Used spec theorems:
Used simplifier rules:
list
/key-list-set/
Nil
list-data
/key-list-set/
size-01
list-data
/address-list-set/
size-01
nat-basic
/
z-01
list-del
/address-list-set/
get-zero-01
nat-basic
/
eq-01
store
/node-index/
At-same
store
/node-index/
insin
list
/key-list-set/
len-05
list
/key-list-set/
c
list-del
/address-list-set/
get-succ
list
/key-list-set/
a
nat-basic
/
c
nat-basic
/
a
nat
/
add-num-01
list
/address-list-set/
a
nat-basic
/
succ
list
/address-list-set/
len-05
list
/address-list-set/
c