[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-mklist-01
⊦ n + m ≤ m0 → sublist(n, m, mklist(a, m0) + x) = mklist(a, m)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
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:
sublist-mklist
,
sublist-append
,
Used spec theorems:
Used simplifier rules:
nat-basic2
/
a
nat-basic2
/
c
list-last
/
mk-inj-01
list-last
/
mk-len
nat
/
lels-01
nat
/
fle
nat
/
fle-01
nat-basic1
/
f
nat-basic1
/
ref-1