[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 at-copy
⊦ m0 < size → copy(ar0, n, ar1, n0, m)(m0) = (m0 < n0 ∨ n0 + m ≤ m0 ⊃ ar1(m0);ar0(m0 + n - n0))
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
copy-append
,
copy-coalesce
,
copy-exact
,
copy-other-weak
,
copy-rec
,
copy-self
,
idexcept-n-copy-other
,
idexcpt-n-copy-hole
,
Used by units in proved state:
array-listops
,
list-as-arrayinstance
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 16
Used lemmas:
Copy-succ
,
Copy-zero
,
Used spec theorems:
fsarray
/
Put-other
Used simplifier rules:
nat-basic
/
f
nat-basic
/
c
nat-basic
/
a
nat-basic
/
add-base
nat
/
lels
nat
/
succ-01
nat-basic
/
succ
fsarray
/
Size-array
nat
/
ls-le-simp
fsarray
/
cgetput
nat-basic
/
l-02
nat-basic
/
l
nat-basic
/
refl-Nat
nat
/
lels-02
nat
/
lep
nat
/
let
nat
/
fle-01
nat
/
add-01
nat
/
elim-sub
nat
/
lep-02
nat-basic
/
eq-01
nat
/
eq-01