[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 unique-prefix
⊦ depths(t0, i) + x = depths(t1, i) + y ↔ x = y ∧ t0 = t1
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp,
Comment:
Used by:
unique-prefix-nil
,
Used by units in proved state:
build
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 12
Proof steps: 24
Used lemmas:
min-le
,
depths-min
,
depths-nonnil
,
depths-node
,
first-in
,
depths-leaf
,
Used spec theorems:
list
/intlist/
firsteq
list
/intlist/
a
Used simplifier rules:
tree
/
inj
int-abs
/
lels-03
int-basic2
/
add-a
int-abs
/
succ-01
list
/intlist/
e-01
list
/intlist/
c
list-data
/intlist/
elim-list-c
list
/intlist/
first-app
list
/intlist/
app-02-ant
tree
/
disj
list
/intlist/
in-append
int-basic2
/
add-c
list
/intlist/
app-01
list
/intlist/
in-17
list
/intlist/
in-11
list
/intlist/
in-14
list
/intlist/
a