[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 copy-shift-append
⊦ m ≤ # ar1 → copy(ar0 + ar1, # ar0, ar, n, m) = copy(ar1, 0, ar, n, m)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
subarray-append-elim-left0
,
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:
append-a
,
copy-append
,
Used spec theorems:
array
/
Extension
Used simplifier rules:
nat
/
ler
nat
/
lep-02
nat-basic
/
a
nat-basic
/
c
nat
/
zero
array-copy
/
size-copy
array-copy
/
at-copy
nat-basic
/
add-base