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