[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 getintarray-subset-01
⊦ st ⊆ st0 ∧ is_arrayref(r, i + j, st) ∧ 0 ≤ i → getintarray(r, i, j, st) = getintarray(r, i, j, st0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
getintarray-subset
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
getarray-subset
,
getintarray
,
is_arrayref
,
Used spec theorems:
Used simplifier rules:
int-basic2
/
add-c
int-abs
/
lels-03
int-abs
/
forward-le-05
int-abs
/
lels-04
int-abs
/
forward-le-01
int-abs
/
lels
int-abs
/
lels-01