[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 case-list
⊦ x = [] ∨ x = x.first + x.rest
Type: A proof obligation
Validity: The proof is valid.
Features:
Comment: |- x = [] or x = x.head + x.tail
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 21
Used lemmas:
get-succ
,
get-zero
,
size-add
,
Used spec theorems:
array
/
Extension
array-listops
/
rest
array-listops
/
first
nat
/
prop-01
array-listops
/
nil
Used simplifier rules:
nat-basic
/
succ
array-copy
/
size-subarray
nat-basic
/
c
nat-basic
/
a
nat-basic
/
oz
nat-basic
/
one-01
nat
/
le-def
array
/
Size-put
array
/
eq-write-left
nat-basic
/
f
array
/
Size-mkarray
nat
/
elim-pred-c
nat
/
le-ls-simp
nat-basic
/
s-04
nat
/
lels
nat
/
lep
nat-basic
/
lf-01
nat
/
lez
nat
/
succ-01
array-copy
/
subarray-at