[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 Uniform-list
INDHYP-list([]), ∀ a, x. INDHYP-list(x) → INDHYP-list(a + x) ⊦ ∀ x. INDHYP-list(x)
Type: A proof obligation
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
oarray-sort
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 16
Proof steps: 28
Used lemmas:
size-add
,
Used spec theorems:
array-listops
/
nil
array-listops
/
rest
array-listops
/
first
array
/
Extension
nat
/
num-02
array-listops
/
cons
array
/
Put-other
array-copy
/
at-copy
Used simplifier rules:
nat
/
lels
nat
/
lez
nat
/
leprf
array-copy
/
size-subarray
array
/
Size-put
array
/
eq-write-left
nat-basic
/
f
array
/
Size-mkarray
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
nat-basic
/
succ
nat-basic
/
oz
nat
/
ls-01
nat-basic
/
one-01
nat
/
le-def
nat
/
elim-pred-c
nat
/
le-ls-simp
nat-basic
/
lf-01
array-copy
/
copy-subarray1-elim
nat
/
ler
nat-basic
/
add-base
nat
/
lep-02
array-copy
/
size-copy
nat-basic
/
zero
array
/
cgetput
nat
/
succ-01
nat
/
add-01