[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 keys-at
⊦ n < # ax → keys(fs, ax)[n] = fs[ax[n]].key
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: 9
Used lemmas:
Used spec theorems:
list-del
/key-list-set/
get-append-grt
Used simplifier rules:
nat
/
lels
nat-basic
/
s-04
nat-basic
/
succ
list
/address-list-set/
len-05
list
/address-list-set/
e-01
list
/key-list-set/
c
aubifs-base
/
keys-rec
list
/address-list-set/
c
list-del
/key-list-set/
get-append-less
list
/key-list-set/
a
list-del
/key-list-set/
one-03
list-del
/address-list-set/
get-zero-01
nat-basic
/
one-01
list
/key-list-set/
len-02
nat
/
elim-pred-c
list-data
/address-list-set/
l
nat-basic
/
f
nat
/
succ-01
list
/address-list-set/
a
list-del
/address-list-set/
get-succ
nat-basic
/
c
nat-basic
/
a
nat-basic
/
oz