[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 tree-toList-size-equal-less-2
⊦ n < 2 ∧ # t0.toList + n = # t1.toList + 1 → # t0 ~ # t1
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
DLL2BST
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 5
Used lemmas:
size-toList
,
equal-or-one-diff
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
nat-basic
/
eq-01
nat
/
neq-add1
nat-basic
/
succ
nat
/
l-num-05
nat-basic
/
one-01
nat-basic
/
add-base
nat-basic
/
a
nat-basic
/
c