[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-subarray2
# ar1 ≥ m0 + m1 ⊦ copy(ar0, n0, subarray(ar1, m0, m1), n1, n2) = subarray(copy(ar0, n0, ar1, m0 + n1, n2), m0, m1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 15
Used lemmas:
at-copy
,
size-copy
,
Subarray
,
Used spec theorems:
array
/
Extension
Used simplifier rules:
nat
/
ge
nat
/
let
nat
/
cancel-01
nat-basic1
/
zero-01
nat-basic2
/
add-base
nat
/
sub-base
nat-basic2
/
l-01
nat
/
fle-01
nat
/
lels-01
nat
/
add-01
nat
/
elim-sub
nat-basic1
/
f
nat
/
lep
nat-basic2
/
l
nat-basic2
/
l-02
nat-basic2
/
a
nat-basic2
/
c
nat
/
lep-02
nat
/
ls-le-simp
nat
/
eq-01
array
/
Size-mkarray
nat
/
lels