[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-firstn
⊦ m ≤ n ∧ n ≤ # x → firstn(m, firstn(n, x)) = firstn(m, x)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
sublist-first-skip
,
sublist-move
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 13
Used lemmas:
firstN-rec-01
,
firstN-empty
,
firstN-rec
,
firstN-zero
,
Used spec theorems:
Used simplifier rules:
nat
/
let
nat-basic
/
f
list-data
/
l
nat
/
fle
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
nat-basic
/
succ
list
/
c
list-data
/
elim-list-c
nat
/
le-ls-simp
nat-basic
/
s-04
nat
/
lels
list
/
a
list
/
len-05
list
/
e
list
/
app-02
list
/
in-rec
list
/
in-14
list
/
c-06
nat
/
pred-03
nat
/
lez
nat-basic
/
less-zero
nat
/
elim-pred-c
nat
/
lep-02
nat-basic
/
oz