[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-cut-l
⊦ p ≠ ε → (p + str0 ' ⊑ str1 ' + q ↔ (∃ p0, q1. p = str1 ' + p0 ∧ q = p0 + str0 ' + q1))
Type: A user defined theorem
Validity: The proof is valid.
Features:
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: 5
Used lemmas:
Used spec theorems:
list-last
/path/
prefix
Used simplifier rules:
list-last
/path/
prefix-one
list-last
/path/
postifx-app-03
list-last
/path/
prefix-rec-02
list
/path/
c-06
list-last
/path/
prefix-rec-03
list
/path/
e-01
list
/path/
c
list
/path/
app-01
list
/path/
app-08
list
/path/
a