[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 sublist-rec-01
n ≤ # x, n ≠ 0 ⊦ sublist(0, n, x) = x.first ' + sublist(0, n -1, x.rest)
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: 0
Proof steps: 2
Used lemmas:
firstN-rec
,
restN-zero
,
sublist-def
,
Used spec theorems:
Used simplifier rules:
nat
/
pred-03
nat-basic2
/
oz
nat-basic2
/
a
nat-basic2
/
c
list
/
c
list
/
app-08
list
/
a
nat
/
elim-pred-c