[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 firstn-butlast-intro
⊦ n < # x → firstn(n, x) = firstn(n, x.butlast)
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: 1
Proof steps: 2
Used lemmas:
first-append
,
Used spec theorems:
Used simplifier rules:
list-data
/
l
nat-basic1
/
f
list
/
e-02
list
/
a
list
/
len
list
/
len-02
nat-basic2
/
s
nat-basic2
/
a
nat-basic2
/
c
nat
/
lels
list-last
/
last-elim