[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 first-append
⊦ m ≤ # x → firstn(m, x + y) = firstn(m, x)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
first-append-01
,
first-mklist-02
,
firstn-butlast-intro
,
sub-len-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 6
Used lemmas:
firstN-rec
,
firstN-zero
,
Used spec theorems:
Used simplifier rules:
list
/
app-08
list
/
rest-01
list
/
first-01
list-data
/
l
nat-basic1
/
f
nat
/
succ-01
list-data
/
elim-list-c
nat
/
lels
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
s
nat-basic2
/
succ
list
/
len-05
list
/
a
list
/
e-01
list
/
c