[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 dropn-first
⊦ n ≠ 0 → dropn(n, x) = (x = [] ⊃ [];dropn(n - 1, x.tail))
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: 9
Used lemmas:
dropn
,
Used spec theorems:
Used simplifier rules:
nat
/
ls-03
nat
/
pred-03
list-data
/
length-rest
nat-basic
/
s-04
nat-basic
/
one-01
nat
/
ls-01
nat-basic
/
ref
nat
/
sub-ls
nat
/
fle
nat-basic
/
f
nat
/
le-def
list-del
/
elim-firstn-restn
nat
/
lep
list
/
len
list
/
rest-01
list-data
/
l
list
/
app-02
list
/
c
list
/
len-05
nat-basic
/
succ
list
/
a
nat
/
add-01
nat-basic
/
add-base
nat-basic
/
a
nat-basic
/
c
list-del
/
restN-len
list-data
/
elim-list-c