[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 range-copy-drop
n0 + m0 ≤ n1 ∨ n1 + m1 ≤ n0, n + m0 ≤ # ar, n0 + m0 ≤ # ar0 ⊦ range=(ar2, n2, copy(ar, n, ar0, n0, m0), n1, m1) ↔ range=(ar2, n2, ar0, n1, 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: 10
Proof steps: 18
Used lemmas:
range-eq-ext
,
Used spec theorems:
array-copy
/
at-copy
Used simplifier rules:
array-copy
/
size-copy
nat
/
le-def
nat
/
lels
nat
/
add-01
nat-basic
/
a
nat-basic
/
c
nat
/
fle-01
nat
/
fle
nat-basic
/
f
nat-basic
/
l-01
nat-basic
/
l-02
nat
/
let
nat
/
lep-02
nat
/
ls-le-simp