[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 split-first
n ≤ # x ⊦ ∃ y, z. x = y + z ∧ # y = n
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
split-rest
,
Used by units in proved state:
list-last
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 11
Used lemmas:
c
,
len-02
,
len
,
a
,
Nil
,
Used spec theorems:
nat
/
sub-add
Used simplifier rules:
list-data
/
size-nil
nat
/
lez-01
list-data
/
l
nat
/
pred-03
nat
/
le-def
nat-basic
/
f
nat
/
le-one
nat-basic
/
a
nat-basic
/
c
nat
/
leprf
nat
/
lez
nat-basic
/
one-01
nat
/
not-zero
nat
/
lep
nat
/
elim-pred-c
nat-basic
/
oz
nat-basic
/
eq-01