[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 ls-at-subarray
n < m1, m0 + m1 ≤ # ar ⊦ (subarray(ar, m0, m1)[n]) = ar[m0 + n]
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp,
Comment:
Used by:
array-exists-first-neq
,
lexicographic-suffix-next
,
lexicographic-trans
,
suffix-same
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 1
Used lemmas:
Used spec theorems:
Used simplifier rules:
array-copy
/
at-subarray
nat-basic2
/
a
nat-basic2
/
c