[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-prefix-fistn
m < # ar ⊦ subarray(ar, 0, m) = firstn(m, ar)
Type: A user defined theorem
Validity: The proof is valid.
Features:
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: 5
Used lemmas:
Used spec theorems:
array
/
Extension
list-del
/list-as-arrayinstance/
get-firstn
Used simplifier rules:
list-data
/list-as-arrayinstance/
l
nat-basic
/
f
nat-basic
/
succ
nat-basic
/
trans-nat
nat-basic
/
lf
nat-basic
/
c
nat-basic
/
a
nat-basic
/
add-base
array-copy
/
subarray-at
array-copy
/
size-subarray
list-del
/list-as-arrayinstance/
firstn-length-03
nat
/
lels-03