[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-other-weak
m0 + n0 ≤ m, m + n ≤ # ar, n0 ≤ # ar1, n ≤ # ar0 ⊦ copy(copy(ar0, 0, ar, m, n), m0, ar1, 0, n0) = copy(ar, m0, ar1, 0, n0)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
copy-other
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 12
Used lemmas:
Copy-succ
,
Copy-zero
,
at-copy
,
size-copy
,
Used spec theorems:
array
/
Extension
Used simplifier rules:
nat-basic
/
f
nat
/
sub-base
nat-basic
/
c
nat-basic
/
a
nat-basic
/
add-base
nat-basic
/
less-zero
nat
/
fle
nat
/
le-def
nat
/
let
nat
/
lels
nat
/
succ-01
nat-basic
/
succ
array
/
cngetput
nat-basic
/
refl-nat
nat-basic
/
l
nat-basic
/
lf-02
nat
/
lels-03
nat
/
fle-01
nat
/
lep-02
nat
/
ls-le-simp