[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 get-split
⊦ n < # x → (x[n] = a ↔ (∃ y, z. x = y + a ' + z ∧ # y = n ∧ # z = # x - n - 1))
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: 3
Proof steps: 14
Used lemmas:
rest-len
,
firstN-rec
,
firstN-zero
,
get-last-04
,
elim-firstn-restn
,
restN-rec
,
firstn-length-03
,
get-app
,
Used spec theorems:
Used simplifier rules:
list-data
/
l
nat-basic
/
f
list
/
a
nat-basic
/
c
nat-basic
/
a
nat-basic
/
add-base
nat
/
add-01
nat
/
eq-01
nat-basic
/
succ
list
/
len-05
list
/
len
list-data
/
elim-add
nat
/
lels
nat-basic
/
s-04
list
/
c
list
/
e
list
/
app-02
nat
/
lep
list
/
len-06
list-data
/
size-nil
list
/
app
list-last
/
last-one
list
/
Nil
list
/
c-04
list
/
len-01
list-last
/
last-rec
list
/
c-07
list
/
c-08
nat
/
pred-03
list-data
/
length-rest
nat
/
ls-le-simp
nat
/
succ-01
nat
/
ls-02
nat-basic
/
one-01
nat
/
le-def
nat-basic
/
lf-01
nat-basic
/
oz
nat
/
elim-pred-c