[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 cut
⊦ ar = [] ∨ (∃ a, ar0. ar = a + ar0)
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: 10
Proof steps: 17
Used lemmas:
nil
,
cons
,
rest
,
first
,
Used spec theorems:
array
/
Extension
array
/
Put-other
array-copy
/
at-copy
Used simplifier rules:
array-copy
/
copy-subarray1-elim
nat
/
sub-ls
nat
/
ls-03
nat
/
lels-01
nat
/
ler
array
/
Size-put
array-copy
/
size-subarray
nat
/
elim-pred-c
nat-basic1
/
zero-01
nat
/
lels
nat-basic1
/
lf-01
nat-basic1
/
f
array-copy
/
size-copy
nat-basic1
/
zero
nat-basic2
/
oz
array
/
cgetput
nat-basic1
/
one-01
nat
/
succ-01
nat
/
le-ls-simp
nat-basic2
/
a
nat-basic2
/
c
nat
/
add-01
nat-basic2
/
add-base
array
/
Size-mkarray
nat-basic2
/
s