[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-right
# ar0 ≤ m0 ⊦ copy(ar, m, ar0 + ar1, m0, m1) = ar0 + copy(ar, m, ar1, m0 - # ar0, m1)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 14
Used lemmas:
append-at2
,
append-at1
,
append-at
,
append-a
,
append-len
,
Used spec theorems:
array
/
Extension
array-copy
/
at-copy
Used simplifier rules:
nat-basic
/
eq-01
array-copy
/
size-copy
nat-basic
/
l-01
nat
/
fle-01
nat
/
add-01
nat
/
lels
nat
/
le-def
nat
/
eq-01
nat-basic
/
a
nat-basic
/
c
nat
/
lep-02
nat
/
lep
nat-basic
/
l
array-copy
/
at-copy
nat-basic
/
l-02
nat-basic
/
f
nat
/
ls-le-simp
nat
/
elim-sub