[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 put-firstn-restn
⊦ n < # x → x[n, a] = firstn(n, x) + a ' + restn(n + 1, x)
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: 5
Proof steps: 16
Used lemmas:
put-zero-01
,
put-app-left
,
put-app-right
,
elim-firstn-restn
,
restN-rec
,
Used spec theorems:
list
/
len-01
Used simplifier rules:
list-data
/
elim-list-c
nat
/
lels
nat-basic2
/
s
nat-basic2
/
l-02
nat
/
lep
nat
/
lels-01
nat-basic1
/
f
nat-basic1
/
lf-02
nat-basic1
/
lf-01
nat-basic1
/
ls-02
nat
/
ler
nat
/
zero
list
/
app-01
list
/
app
nat-basic2
/
eq
nat-basic2
/
z-01
nat-basic2
/
a
nat-basic2
/
c
list
/
app-08
list
/
in-append
list
/
in-14
list
/
e-01
list
/
Nil
list-data
/
size-01
list-data
/
l
list
/
in-empty
list
/
in-rec
nat-basic2
/
succ
list
/
len-05
list
/
c-06
list
/
c
list
/
len
list
/
len-02
list
/
a