[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-sublist
⊦ n→i(m) + n→i(n) ≤ j → sublist(m, n, getarray(r, i, j, st)) = getarray(r, i + n→i(m), n→i(n), st)
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: 5
Proof steps: 16
Used lemmas:
get-rec-01
,
get-rest
,
get-first
,
get-empty
,
get-zero
,
Used spec theorems:
list-del
/javavalues/
sub-zerorec
Used simplifier rules:
intnat
/
pos-add
list-del
/javavalues/
sub-rec
intnat
/
nat2int
int-abs
/
numsub
list
/javavalues/
app-01
list
/javavalues/
a
int-abs
/
lels-04
int-abs
/
forward-le-01
int-abs
/
mone-06
int-abs
/
numls-02
int-abs
/
succ-02
int-abs
/
elim-sub
list
/javavalues/
c
int-abs
/
lels-03
intnat
/
pos-int
int-abs
/
lels-01
int-abs
/
succ-01
nat-basic2
/
c
nat-basic2
/
a
intnat
/
n2i-add
nat-basic2
/
succ
list-del
/javavalues/
sub-zerozero
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
ax-04