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