[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 isprefix-eq-size-app-eq
⊦ # x0 = # x1 + # x2 → (x0 ⊑ x1 + x2 ↔ x0 = x1 + x2)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 9
Used lemmas:
Used spec theorems:
list-last
/
prefix
list-del
/
extension
Used simplifier rules:
list-last
/
prefix-self
list-last
/
postifx-app-03
nat-basic
/
add-base
list-data
/
size-01
nat-basic
/
f
list-del
/
get-append-less
nat-basic
/
c
nat-basic
/
a
list-data
/
l
nat-basic
/
eq-02
nat-basic
/
lf-01
list
/
a
list
/
len