[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-append-less
⊦ n < # x → (x + y)[n] = x[n]
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
get-last-04
,
rev-get
,
Used by units in proved state:
stut-mon-old
,
stut-mon
,
streamseq-mon-lim-old
,
streamseq-mon-lim
,
stream-old
,
stream
,
olist-min-max
,
mon-lim-filter-count-old
,
mon-lim-filter-count
,
list-set
,
inf-app-list-old
,
inf-app-list
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 9
Used lemmas:
get-succ
,
get-zero
,
Used spec theorems:
list-getput
/
get-rec
Used simplifier rules:
list-data
/
l
nat-basic
/
f
nat
/
lels
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
list
/
a
nat-basic
/
succ
list
/
len-05
list
/
c
list
/
e
list
/
app-02
list
/
c-07
nat
/
elim-pred-c
nat
/
succ-01
nat-basic
/
oz