[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 addarray-mklist-01
⊦ 0 ≤ i ∧ 0 ≤ j → addarray(r, mklist(initial_value(byte_type), i→n(j)), i, addarray(r, mklist(initial_value(byte_type), i→n(i)), 0, st)) = addarray(r, initial_value(byte_type), j + i, st)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
addarray-mklist
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
addarray-mklist-04
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-01
int-basic2
/
add-c
intnat
/
i2i-pos-01