[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 prefix-append-one-sizeeq
# x0 = # x1 + 1 ⊦ x0 ⊑ x1 + a ' ↔ x0 = x1 + a '
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: 2
Proof steps: 4
Used lemmas:
Used spec theorems:
list-last
/
prefix
list-data
/
length-neq
Used simplifier rules:
list
/
e
list-last
/
prefix-one-01
list-last
/
postifx-app-03
list
/
ni
list
/
in-append
list
/
app-04
list
/
in-15
list
/
len
list
/
a
list
/
len-02
nat-basic
/
eq-02
list-data
/
l
nat-basic
/
a
nat-basic
/
c