[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-move
⊦ n + m ≤ m0 ∧ n0 + m0 ≤ # x → sublist(n, m, sublist(n0, m0, x)) = sublist(n0 + n, m, x)
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: 6
Proof steps: 22
Used lemmas:
restN-rec
,
firstn-firstn
,
firstN-rec
,
first-num
,
rest-rec
,
firstN-zero
,
restN-zero
,
sublist-def
,
Used spec theorems:
Used simplifier rules:
list-data
/
size-01
nat-basic2
/
succ
list
/
len-05
nat
/
lez-01
nat-basic2
/
z-01
nat
/
lez
list
/
c-08
list
/
c
list
/
app-08
nat
/
elim-pred-c
nat-basic1
/
zero
nat
/
pred-03
nat
/
let
nat-basic2
/
add-base
nat
/
lep-02
nat-basic2
/
oz
nat-basic2
/
c
nat-basic2
/
a
list
/
a
list
/
c-07