[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 get-first
⊦ 0 < j → getarray(r, i, j, st) .first = st[r -- i ']
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
get-sublist
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 9
Used lemmas:
get-zero
,
get-empty
,
getArray-one
,
getArray-rec
,
Used spec theorems:
list
/javavalues/
first-01
Used simplifier rules:
int-abs
/
anti
int-basic1
/
lf-03
int-basic2
/
ax-04
list
/javavalues/
Nil
list
/javavalues/
a
intnat
/
abs-succ-03
nat-basic2
/
s
intnat
/
labs
int-abs
/
abs-16
oelem
/intlista/
irreflexivity
nat-basic2
/
a
nat-basic2
/
c
int-abs
/
leone
int-abs
/
succ-02
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
sub-add
int-abs
/
elim-sub
list
/javavalues/
Last
int-abs
/
lels
int-abs
/
bet
int-basic1
/
lf-02
list
/javavalues/
first