[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-append-elim-left
# ar0 ≤ n0, n0 + m ≤ # ar0 + # ar1 ⊦ subarray(ar0 + ar1, n0, m) = subarray(ar1, n0 - # ar0, m)
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 6
Used lemmas:
append-a
,
copy-append
,
Used spec theorems:
array-copy
/
Subarray
Used simplifier rules:
nat
/
elim-sub
nat
/
lep
nat-basic
/
a
nat-basic
/
c
nat
/
lep-02
nat
/
eq-01