[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 id-circle-subarray-concrete-below
n0 < n, n + m + m0 ≤ # avol ⊦ id○(avol, avol0, (* n0)) → subarray(avol, (* n) + m, m0) = subarray(avol0, n + m, m0)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
inv-commit
,
inv-format
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 7
Used lemmas:
Used spec theorems:
array
/avolume/
Extension
array-copy
/avolume/
Idexcept
Used simplifier rules:
array-copy
/avolume/
idexcept-size
nat-basic
/
f
array-copy
/avolume/
subarray-at
array-copy
/avolume/
size-subarray
nat
/
lels
nat
/
let
nat
/
lep-02
nat
/
ls-le-simp
nat-basic
/
a
nat-basic
/
c
nat-basic
/
l-02