[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 key-cons-ext
⊦ key-cons(ndx) ↔ (∀ n. n < # ndx → key-cons(ndx[n].key, ndx[n]))
Type: A user defined theorem
Validity: The proof is valid.
Features:
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: 14
Used lemmas:
key-cons-rec
,
key-cons-base
,
Used spec theorems:
list-del
/node-list/
get-append-grt
Used simplifier rules:
list-data
/node-list/
size-01
nat-basic
/
succ
list
/node-list/
len-05
list
/node-list/
c
nat
/
lels
nat
/
lez
nat-basic
/
one-01
list
/node-list/
len-02
nat
/
elim-pred-c
nat
/
succ-01
nat-basic
/
oz
list-data
/node-list/
l
nat-basic
/
f
nat-basic
/
s-04
nat-basic
/
a
nat-basic
/
c
list-del
/node-list/
get-succ
nat-basic
/
zero-01
list-del
/node-list/
get-zero-01
list
/node-list/
a