[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 at-subarray
⊦ n + m ≤ # ar ∧ n0 < n → subarray(ar, m, n)[n0] = ar[m + n0]
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
at-copy
,
Subarray
,
Used spec theorems:
Used simplifier rules:
nat-basic1
/
f
nat-basic1
/
zero-01
nat-basic2
/
add-base
nat-basic2
/
a
nat-basic2
/
c
nat
/
ls-le-simp
nat
/
sub-base
array
/
Size-mkarray
nat
/
lels