[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 list-split
⊦ x ⊑ y + z ∧ # x ≤ # y → (∃ y1. y = x + y1)
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: 1
Proof steps: 9
Used lemmas:
Used spec theorems:
list-last
/
prefix-rec
Used simplifier rules:
nat
/
lez-01
list-data
/
l
list-last
/
prefix-nil
list-data
/
size-01
nat
/
lez
list
/
Nil
list-data
/
elim-list-c
list
/
app-08
nat
/
lep-02
nat-basic
/
succ
list
/
len-05
list
/
e-01
list
/
c
list
/
len
list
/
a
nat
/
lep
nat-basic
/
a
nat-basic
/
c
list-last
/
prefix-app-05
list
/
app-01