[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-avol-write
n < m ⊦ # avol = main + m → subarray(avol[main + n, aleb], main, m) = subarray(avol, main, m)[n, aleb]
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
refine-remap
,
refine-unmap
,
refine-write
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 5
Used lemmas:
Used spec theorems:
array
/avolume/
Extension
Used simplifier rules:
nat-basic
/
f
array
/avolume/
Size-put
array
/avolume/
Put-other
array
/avolume/
cngetput
array-copy
/avolume/
subarray-at
nat-basic
/
eq-01
nat-basic
/
a
nat-basic
/
c
nat-basic
/
lf-02
nat-basic
/
l
nat
/
lels
nat
/
ls-le-simp
array
/avolume/
cgetput
array-copy
/avolume/
size-subarray