[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 rangeeq-write-right-concrete-below
n0 < n ⊦ range=(avol, (* n) + m, avol0[(* n0), aleb], (* n) + m, m1) ↔ range=(avol, n + m, avol0, n + m, m1)
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: 4
Used lemmas:
Used spec theorems:
array-splice
/avolume/
range-eq-ext
Used simplifier rules:
nat-basic
/
f
array
/avolume/
cngetput
nat-basic
/
l-02
array
/avolume/
Size-put
nat-basic
/
a
nat-basic
/
c