[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-init-2
⊦ partitions(P, # A) ∧ split(P, A, X) ∧ (∀ p. p ∈ P → p.count = 0) → split(P, A, [])
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: 15
Proof steps: 34
Used lemmas:
inpartelem-def
,
splitone-def
,
split-def
,
partititions-def
,
Used spec theorems:
Used simplifier rules:
list
/partition/
in-empty
nat-basic1
/
zero-01
list-data
/partition/
size-01
list
/partition/
c
list
/partition/
a
list
/partition/
in-17
list
/partition/
in-append
partelem
/
elim
nat-basic1
/
f
list
/list_of_nat/
in-empty
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
ax-08
partelem
/
sel-05
partelem
/
sel-03
nat
/
ls-le-simp