[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-emparray
n2 ≤ n1 ⊦ subarray(mkemparray(n0 + n1), n0, n2) = mkemparray(n2)
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: 2
Proof steps: 4
Used lemmas:
emparray
,
Used spec theorems:
array
/
Extension
array-copy
/
at-fill
Used simplifier rules:
nat
/
fle
nat-basic
/
f
array-copy
/
at-fill-mkarray
array-copy
/
subarray-at
array-copy
/
size-fill
array-copy
/
size-subarray
array
/
Size-mkarray
nat-basic
/
l
nat
/
lels
nat
/
ls-le-simp
nat-basic
/
a
nat-basic
/
c