[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-write-above
n ≥ n0 + n1 ⊦ subarray(ar[n, a], n0, n1) = subarray(ar, n0, n1)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 10
Used lemmas:
subarray-at
,
size-subarray
,
Used spec theorems:
nat
/
ge
array
/
Extension
Used simplifier rules:
array
/
Put-other
nat
/
lep-02
nat
/
ls-le-simp
nat-basic
/
a
nat-basic
/
c