[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 soundness
⊦ 〈build#(x; to)〉 (to ≠ fail → x = depths(to .t, 0))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
termination
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 34
Used lemmas:
build-rec
,
soundness-rec
,
build
,
Used spec theorems:
build-base
/
max-ge
Used simplifier rules:
list
/intlist/
app
list
/intlist/
c-08
int-abs
/
zero-gels-01
list
/intlist/
in-17
list
/intlist/
in-append
list
/intlist/
in-14
list
/intlist/
a
list
/intlist/
e-01
list
/intlist/
c
list-data
/intlist/
elim-list-c
int-abs
/
forward-lels
list
/intlist/
in-08
int-abs
/
forward-le-02
int-abs
/
lels-01
build-base
/
depths-nonnil
int-abs
/
ler
build-base
/
is-empty