[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 append-eqlen
⊦ # str = # str1 → (str + str0 = str1 + str2 ↔ str = str1 ∧ str0 = str2)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
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: 6
Used lemmas:
append-eqlen-01
,
Length-rec
,
len-zero
,
Length-empty
,
Used spec theorems:
Used simplifier rules:
string-append
/
append-base
nat-basic2
/
z-01
string-append
/
chartostring-01
string-append
/
assoc
nat-basic2
/
eq-01
nat-basic2
/
a
nat-basic2
/
c
string-append
/
one
string-data
/
elim